./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00e4f55488ef7cc05fee246c4257b6c9346382d0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00e4f55488ef7cc05fee246c4257b6c9346382d0 ............................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 17:09:14,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:09:14,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:09:14,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:09:14,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:09:14,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:09:14,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:09:14,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:09:14,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:09:14,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:09:14,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:09:14,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:09:14,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:09:14,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:09:14,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:09:14,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:09:14,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:09:14,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:09:14,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:09:14,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:09:14,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:09:14,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:09:14,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:09:14,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:09:14,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:09:14,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:09:14,070 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:09:14,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:09:14,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:09:14,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:09:14,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:09:14,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:09:14,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:09:14,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:09:14,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:09:14,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:09:14,073 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:09:14,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:09:14,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:09:14,081 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:09:14,081 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:09:14,081 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:09:14,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:09:14,081 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:09:14,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:09:14,082 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:09:14,082 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:09:14,082 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:09:14,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:09:14,082 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:09:14,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:09:14,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:09:14,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:09:14,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:09:14,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:09:14,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:09:14,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:09:14,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:09:14,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:09:14,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:09:14,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:09:14,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:09:14,086 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 00e4f55488ef7cc05fee246c4257b6c9346382d0 [2018-12-02 17:09:14,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:09:14,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:09:14,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:09:14,122 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:09:14,122 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:09:14,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-12-02 17:09:14,159 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/5a8847d68/4ef1a997984d458e8ff4e4724cd70683/FLAG800363018 [2018-12-02 17:09:14,516 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:09:14,516 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-12-02 17:09:14,525 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/5a8847d68/4ef1a997984d458e8ff4e4724cd70683/FLAG800363018 [2018-12-02 17:09:14,890 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/5a8847d68/4ef1a997984d458e8ff4e4724cd70683 [2018-12-02 17:09:14,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:09:14,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:09:14,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:09:14,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:09:14,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:09:14,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:09:14" (1/1) ... [2018-12-02 17:09:14,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4799108e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:14, skipping insertion in model container [2018-12-02 17:09:14,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:09:14" (1/1) ... [2018-12-02 17:09:14,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:09:14,930 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:09:15,171 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:09:15,179 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:09:15,231 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:09:15,242 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:09:15,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15 WrapperNode [2018-12-02 17:09:15,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:09:15,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:09:15,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:09:15,243 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:09:15,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:09:15,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:09:15,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:09:15,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:09:15,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... [2018-12-02 17:09:15,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:09:15,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:09:15,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:09:15,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:09:15,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:09:15,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 17:09:15,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 17:09:15,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 17:09:15,343 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 17:09:15,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 17:09:15,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 17:09:15,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 17:09:15,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:09:15,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:09:15,576 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 17:09:15,576 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 17:09:15,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:09:15,943 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 17:09:15,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:09:15 BoogieIcfgContainer [2018-12-02 17:09:15,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:09:15,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:09:15,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:09:15,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:09:15,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:09:14" (1/3) ... [2018-12-02 17:09:15,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdee5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:09:15, skipping insertion in model container [2018-12-02 17:09:15,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:09:15" (2/3) ... [2018-12-02 17:09:15,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdee5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:09:15, skipping insertion in model container [2018-12-02 17:09:15,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:09:15" (3/3) ... [2018-12-02 17:09:15,948 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-12-02 17:09:15,955 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:09:15,960 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 17:09:15,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 17:09:15,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:09:15,990 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:09:15,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:09:15,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:09:15,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:09:15,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:09:15,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:09:15,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:09:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-12-02 17:09:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 17:09:16,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:16,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:16,010 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:16,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:16,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1596262401, now seen corresponding path program 1 times [2018-12-02 17:09:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:16,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:16,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:16,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:16,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:16,213 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-12-02 17:09:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:16,475 INFO L93 Difference]: Finished difference Result 339 states and 570 transitions. [2018-12-02 17:09:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:16,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-02 17:09:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:16,485 INFO L225 Difference]: With dead ends: 339 [2018-12-02 17:09:16,485 INFO L226 Difference]: Without dead ends: 172 [2018-12-02 17:09:16,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-02 17:09:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-12-02 17:09:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 17:09:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2018-12-02 17:09:16,522 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 49 [2018-12-02 17:09:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:16,522 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2018-12-02 17:09:16,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2018-12-02 17:09:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 17:09:16,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:16,525 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:16,525 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:16,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1059853705, now seen corresponding path program 1 times [2018-12-02 17:09:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:16,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:16,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:16,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:16,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:16,616 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2018-12-02 17:09:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:16,797 INFO L93 Difference]: Finished difference Result 302 states and 461 transitions. [2018-12-02 17:09:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:16,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 17:09:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:16,798 INFO L225 Difference]: With dead ends: 302 [2018-12-02 17:09:16,798 INFO L226 Difference]: Without dead ends: 172 [2018-12-02 17:09:16,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:16,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-02 17:09:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2018-12-02 17:09:16,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-02 17:09:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2018-12-02 17:09:16,805 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 62 [2018-12-02 17:09:16,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:16,805 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2018-12-02 17:09:16,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2018-12-02 17:09:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 17:09:16,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:16,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:16,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:16,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:16,807 INFO L82 PathProgramCache]: Analyzing trace with hash 337135581, now seen corresponding path program 1 times [2018-12-02 17:09:16,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:16,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:16,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:16,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:16,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:09:16,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:16,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:09:16,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:09:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:16,864 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 5 states. [2018-12-02 17:09:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:17,158 INFO L93 Difference]: Finished difference Result 306 states and 469 transitions. [2018-12-02 17:09:17,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:09:17,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-02 17:09:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:17,159 INFO L225 Difference]: With dead ends: 306 [2018-12-02 17:09:17,159 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 17:09:17,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:09:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 17:09:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-12-02 17:09:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 17:09:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2018-12-02 17:09:17,165 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 63 [2018-12-02 17:09:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:17,165 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2018-12-02 17:09:17,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:09:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2018-12-02 17:09:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 17:09:17,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:17,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:17,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:17,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1452142420, now seen corresponding path program 1 times [2018-12-02 17:09:17,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:17,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:17,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:17,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:17,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:17,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:17,219 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2018-12-02 17:09:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:17,362 INFO L93 Difference]: Finished difference Result 339 states and 509 transitions. [2018-12-02 17:09:17,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:17,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 17:09:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:17,364 INFO L225 Difference]: With dead ends: 339 [2018-12-02 17:09:17,364 INFO L226 Difference]: Without dead ends: 189 [2018-12-02 17:09:17,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-02 17:09:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 175. [2018-12-02 17:09:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 17:09:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2018-12-02 17:09:17,370 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 63 [2018-12-02 17:09:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2018-12-02 17:09:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2018-12-02 17:09:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 17:09:17,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:17,371 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:17,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:17,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1519702421, now seen corresponding path program 1 times [2018-12-02 17:09:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:17,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:17,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:17,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:17,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:17,406 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2018-12-02 17:09:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:17,552 INFO L93 Difference]: Finished difference Result 338 states and 507 transitions. [2018-12-02 17:09:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:17,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 17:09:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:17,553 INFO L225 Difference]: With dead ends: 338 [2018-12-02 17:09:17,553 INFO L226 Difference]: Without dead ends: 188 [2018-12-02 17:09:17,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-02 17:09:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-12-02 17:09:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 17:09:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2018-12-02 17:09:17,559 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 63 [2018-12-02 17:09:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:17,560 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2018-12-02 17:09:17,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2018-12-02 17:09:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 17:09:17,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:17,561 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:17,561 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:17,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1612792454, now seen corresponding path program 1 times [2018-12-02 17:09:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:17,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:17,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:17,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:17,615 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2018-12-02 17:09:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:17,755 INFO L93 Difference]: Finished difference Result 338 states and 506 transitions. [2018-12-02 17:09:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:17,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 17:09:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:17,756 INFO L225 Difference]: With dead ends: 338 [2018-12-02 17:09:17,756 INFO L226 Difference]: Without dead ends: 188 [2018-12-02 17:09:17,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-02 17:09:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-12-02 17:09:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 17:09:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2018-12-02 17:09:17,761 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 64 [2018-12-02 17:09:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:17,761 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2018-12-02 17:09:17,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2018-12-02 17:09:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 17:09:17,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:17,762 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:17,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:17,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1744402129, now seen corresponding path program 1 times [2018-12-02 17:09:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:17,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:17,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:17,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:17,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:17,819 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2018-12-02 17:09:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:17,962 INFO L93 Difference]: Finished difference Result 338 states and 505 transitions. [2018-12-02 17:09:17,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:17,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 17:09:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:17,963 INFO L225 Difference]: With dead ends: 338 [2018-12-02 17:09:17,963 INFO L226 Difference]: Without dead ends: 188 [2018-12-02 17:09:17,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-02 17:09:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2018-12-02 17:09:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 17:09:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2018-12-02 17:09:17,968 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 65 [2018-12-02 17:09:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:17,969 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2018-12-02 17:09:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2018-12-02 17:09:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 17:09:17,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:17,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:17,970 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:17,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1864174496, now seen corresponding path program 1 times [2018-12-02 17:09:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:17,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:17,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:18,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:18,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:18,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:18,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:18,021 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2018-12-02 17:09:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:18,190 INFO L93 Difference]: Finished difference Result 367 states and 551 transitions. [2018-12-02 17:09:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:18,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 17:09:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:18,191 INFO L225 Difference]: With dead ends: 367 [2018-12-02 17:09:18,192 INFO L226 Difference]: Without dead ends: 217 [2018-12-02 17:09:18,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-02 17:09:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2018-12-02 17:09:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2018-12-02 17:09:18,197 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 66 [2018-12-02 17:09:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:18,197 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2018-12-02 17:09:18,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2018-12-02 17:09:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 17:09:18,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:18,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:18,198 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:18,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2082272577, now seen corresponding path program 1 times [2018-12-02 17:09:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:18,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:18,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:18,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:18,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:18,235 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand 4 states. [2018-12-02 17:09:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:18,396 INFO L93 Difference]: Finished difference Result 382 states and 578 transitions. [2018-12-02 17:09:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:18,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 17:09:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:18,397 INFO L225 Difference]: With dead ends: 382 [2018-12-02 17:09:18,397 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 17:09:18,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 17:09:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2018-12-02 17:09:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2018-12-02 17:09:18,401 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 66 [2018-12-02 17:09:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:18,401 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2018-12-02 17:09:18,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2018-12-02 17:09:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 17:09:18,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:18,402 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:18,402 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:18,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 224292396, now seen corresponding path program 1 times [2018-12-02 17:09:18,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:18,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:18,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:18,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:18,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:18,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:18,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:18,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:18,440 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2018-12-02 17:09:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:18,579 INFO L93 Difference]: Finished difference Result 372 states and 565 transitions. [2018-12-02 17:09:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:18,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 17:09:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:18,580 INFO L225 Difference]: With dead ends: 372 [2018-12-02 17:09:18,580 INFO L226 Difference]: Without dead ends: 200 [2018-12-02 17:09:18,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-02 17:09:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-12-02 17:09:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2018-12-02 17:09:18,585 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 67 [2018-12-02 17:09:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:18,585 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2018-12-02 17:09:18,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2018-12-02 17:09:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 17:09:18,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:18,586 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:18,586 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:18,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1001313206, now seen corresponding path program 1 times [2018-12-02 17:09:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:18,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:18,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:18,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:18,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:18,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:18,618 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2018-12-02 17:09:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:18,789 INFO L93 Difference]: Finished difference Result 389 states and 585 transitions. [2018-12-02 17:09:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:18,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 17:09:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:18,790 INFO L225 Difference]: With dead ends: 389 [2018-12-02 17:09:18,790 INFO L226 Difference]: Without dead ends: 217 [2018-12-02 17:09:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-02 17:09:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2018-12-02 17:09:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2018-12-02 17:09:18,796 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 79 [2018-12-02 17:09:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:18,796 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2018-12-02 17:09:18,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2018-12-02 17:09:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 17:09:18,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:18,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:18,798 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:18,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:18,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1980477619, now seen corresponding path program 1 times [2018-12-02 17:09:18,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:18,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:18,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:18,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:18,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:18,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:18,840 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2018-12-02 17:09:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:19,011 INFO L93 Difference]: Finished difference Result 387 states and 581 transitions. [2018-12-02 17:09:19,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:19,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 17:09:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:19,012 INFO L225 Difference]: With dead ends: 387 [2018-12-02 17:09:19,012 INFO L226 Difference]: Without dead ends: 215 [2018-12-02 17:09:19,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-02 17:09:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2018-12-02 17:09:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2018-12-02 17:09:19,019 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 80 [2018-12-02 17:09:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:19,019 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2018-12-02 17:09:19,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2018-12-02 17:09:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 17:09:19,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:19,020 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:19,020 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:19,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2048037620, now seen corresponding path program 1 times [2018-12-02 17:09:19,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:19,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:19,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:19,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:19,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:19,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,057 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2018-12-02 17:09:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:19,229 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2018-12-02 17:09:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:19,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 17:09:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:19,231 INFO L225 Difference]: With dead ends: 386 [2018-12-02 17:09:19,231 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 17:09:19,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 17:09:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-12-02 17:09:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2018-12-02 17:09:19,238 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 80 [2018-12-02 17:09:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:19,239 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2018-12-02 17:09:19,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2018-12-02 17:09:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 17:09:19,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:19,240 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:19,240 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:19,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash 811314439, now seen corresponding path program 1 times [2018-12-02 17:09:19,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:19,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:19,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:19,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:19,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,299 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2018-12-02 17:09:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:19,457 INFO L93 Difference]: Finished difference Result 386 states and 576 transitions. [2018-12-02 17:09:19,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:19,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 17:09:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:19,458 INFO L225 Difference]: With dead ends: 386 [2018-12-02 17:09:19,458 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 17:09:19,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 17:09:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-12-02 17:09:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2018-12-02 17:09:19,463 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2018-12-02 17:09:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:19,463 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2018-12-02 17:09:19,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2018-12-02 17:09:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 17:09:19,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:19,464 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:19,464 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:19,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:19,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1626579856, now seen corresponding path program 1 times [2018-12-02 17:09:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:19,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:19,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:19,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,513 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2018-12-02 17:09:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:19,652 INFO L93 Difference]: Finished difference Result 386 states and 574 transitions. [2018-12-02 17:09:19,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:19,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 17:09:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:19,654 INFO L225 Difference]: With dead ends: 386 [2018-12-02 17:09:19,654 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 17:09:19,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 17:09:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-12-02 17:09:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2018-12-02 17:09:19,660 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 82 [2018-12-02 17:09:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:19,661 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2018-12-02 17:09:19,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2018-12-02 17:09:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 17:09:19,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:19,662 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:19,662 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:19,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:19,662 INFO L82 PathProgramCache]: Analyzing trace with hash 661046146, now seen corresponding path program 1 times [2018-12-02 17:09:19,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:19,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:19,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:19,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:19,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:19,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,709 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2018-12-02 17:09:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:19,886 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2018-12-02 17:09:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:19,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 17:09:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:19,887 INFO L225 Difference]: With dead ends: 386 [2018-12-02 17:09:19,887 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 17:09:19,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 17:09:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2018-12-02 17:09:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2018-12-02 17:09:19,891 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 83 [2018-12-02 17:09:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:19,891 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2018-12-02 17:09:19,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2018-12-02 17:09:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 17:09:19,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:19,892 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:19,892 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:19,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash -884054005, now seen corresponding path program 1 times [2018-12-02 17:09:19,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:19,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:19,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:19,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:09:19,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:19,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:19,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:19,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:19,939 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2018-12-02 17:09:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:20,060 INFO L93 Difference]: Finished difference Result 376 states and 558 transitions. [2018-12-02 17:09:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:20,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-02 17:09:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:20,061 INFO L225 Difference]: With dead ends: 376 [2018-12-02 17:09:20,061 INFO L226 Difference]: Without dead ends: 204 [2018-12-02 17:09:20,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-02 17:09:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2018-12-02 17:09:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-02 17:09:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2018-12-02 17:09:20,065 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 84 [2018-12-02 17:09:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:20,065 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2018-12-02 17:09:20,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2018-12-02 17:09:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 17:09:20,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:20,066 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:20,066 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:20,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1973602915, now seen corresponding path program 1 times [2018-12-02 17:09:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:20,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:20,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:20,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:20,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:20,103 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2018-12-02 17:09:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:20,333 INFO L93 Difference]: Finished difference Result 477 states and 712 transitions. [2018-12-02 17:09:20,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:20,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 17:09:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:20,334 INFO L225 Difference]: With dead ends: 477 [2018-12-02 17:09:20,334 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 17:09:20,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 17:09:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2018-12-02 17:09:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-02 17:09:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2018-12-02 17:09:20,339 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 88 [2018-12-02 17:09:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:20,339 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2018-12-02 17:09:20,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2018-12-02 17:09:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 17:09:20,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:20,340 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:20,340 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:20,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1897717659, now seen corresponding path program 1 times [2018-12-02 17:09:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:20,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:20,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:20,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:20,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:20,389 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2018-12-02 17:09:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:20,573 INFO L93 Difference]: Finished difference Result 499 states and 764 transitions. [2018-12-02 17:09:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:20,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 17:09:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:20,574 INFO L225 Difference]: With dead ends: 499 [2018-12-02 17:09:20,574 INFO L226 Difference]: Without dead ends: 286 [2018-12-02 17:09:20,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-02 17:09:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2018-12-02 17:09:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-02 17:09:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2018-12-02 17:09:20,580 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 88 [2018-12-02 17:09:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:20,580 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2018-12-02 17:09:20,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2018-12-02 17:09:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 17:09:20,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:20,581 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:20,581 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:20,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -898814929, now seen corresponding path program 1 times [2018-12-02 17:09:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:20,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:20,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:20,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:20,616 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2018-12-02 17:09:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:20,845 INFO L93 Difference]: Finished difference Result 558 states and 855 transitions. [2018-12-02 17:09:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:20,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-02 17:09:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:20,846 INFO L225 Difference]: With dead ends: 558 [2018-12-02 17:09:20,846 INFO L226 Difference]: Without dead ends: 321 [2018-12-02 17:09:20,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-02 17:09:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2018-12-02 17:09:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2018-12-02 17:09:20,851 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 89 [2018-12-02 17:09:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:20,852 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2018-12-02 17:09:20,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2018-12-02 17:09:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 17:09:20,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:20,852 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:20,852 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:20,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -444546457, now seen corresponding path program 1 times [2018-12-02 17:09:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:20,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:20,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:20,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:20,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:20,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:20,888 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2018-12-02 17:09:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:21,096 INFO L93 Difference]: Finished difference Result 559 states and 855 transitions. [2018-12-02 17:09:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:21,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 17:09:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:21,098 INFO L225 Difference]: With dead ends: 559 [2018-12-02 17:09:21,098 INFO L226 Difference]: Without dead ends: 321 [2018-12-02 17:09:21,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-02 17:09:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2018-12-02 17:09:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2018-12-02 17:09:21,103 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 101 [2018-12-02 17:09:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:21,104 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2018-12-02 17:09:21,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2018-12-02 17:09:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 17:09:21,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:21,104 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:21,104 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:21,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 431472549, now seen corresponding path program 1 times [2018-12-02 17:09:21,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:21,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:21,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:21,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:21,142 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2018-12-02 17:09:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:21,354 INFO L93 Difference]: Finished difference Result 525 states and 804 transitions. [2018-12-02 17:09:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:21,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 17:09:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:21,355 INFO L225 Difference]: With dead ends: 525 [2018-12-02 17:09:21,355 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 17:09:21,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 17:09:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-12-02 17:09:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2018-12-02 17:09:21,365 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 101 [2018-12-02 17:09:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:21,365 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2018-12-02 17:09:21,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2018-12-02 17:09:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:09:21,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:21,366 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:21,366 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:21,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2060377654, now seen corresponding path program 1 times [2018-12-02 17:09:21,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:21,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:21,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:21,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:21,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:21,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:21,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:21,424 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2018-12-02 17:09:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:21,647 INFO L93 Difference]: Finished difference Result 557 states and 849 transitions. [2018-12-02 17:09:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:21,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 17:09:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:21,648 INFO L225 Difference]: With dead ends: 557 [2018-12-02 17:09:21,648 INFO L226 Difference]: Without dead ends: 319 [2018-12-02 17:09:21,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-02 17:09:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 263. [2018-12-02 17:09:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2018-12-02 17:09:21,654 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 102 [2018-12-02 17:09:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:21,654 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2018-12-02 17:09:21,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2018-12-02 17:09:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:09:21,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:21,654 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:21,655 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:21,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2127937655, now seen corresponding path program 1 times [2018-12-02 17:09:21,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:21,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:21,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:21,698 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2018-12-02 17:09:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:21,898 INFO L93 Difference]: Finished difference Result 556 states and 846 transitions. [2018-12-02 17:09:21,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:21,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 17:09:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:21,899 INFO L225 Difference]: With dead ends: 556 [2018-12-02 17:09:21,899 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 17:09:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 17:09:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-12-02 17:09:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2018-12-02 17:09:21,905 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 102 [2018-12-02 17:09:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:21,905 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2018-12-02 17:09:21,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2018-12-02 17:09:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:09:21,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:21,906 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:21,906 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:21,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -847804232, now seen corresponding path program 1 times [2018-12-02 17:09:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:21,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:21,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:21,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:21,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:21,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:21,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:21,937 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2018-12-02 17:09:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:22,087 INFO L93 Difference]: Finished difference Result 523 states and 796 transitions. [2018-12-02 17:09:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:22,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 17:09:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:22,088 INFO L225 Difference]: With dead ends: 523 [2018-12-02 17:09:22,088 INFO L226 Difference]: Without dead ends: 285 [2018-12-02 17:09:22,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-02 17:09:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2018-12-02 17:09:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2018-12-02 17:09:22,098 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 102 [2018-12-02 17:09:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:22,098 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2018-12-02 17:09:22,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2018-12-02 17:09:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 17:09:22,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:22,099 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:22,099 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:22,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash -780244231, now seen corresponding path program 1 times [2018-12-02 17:09:22,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:22,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:22,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:22,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:22,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:22,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:22,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:22,151 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2018-12-02 17:09:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:22,302 INFO L93 Difference]: Finished difference Result 522 states and 793 transitions. [2018-12-02 17:09:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:22,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 17:09:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:22,303 INFO L225 Difference]: With dead ends: 522 [2018-12-02 17:09:22,303 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 17:09:22,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 17:09:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-12-02 17:09:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2018-12-02 17:09:22,313 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 102 [2018-12-02 17:09:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:22,313 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2018-12-02 17:09:22,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2018-12-02 17:09:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 17:09:22,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:22,314 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:22,315 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:22,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1006751772, now seen corresponding path program 1 times [2018-12-02 17:09:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:22,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:22,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:22,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:22,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:22,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:22,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:22,349 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2018-12-02 17:09:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:22,554 INFO L93 Difference]: Finished difference Result 556 states and 840 transitions. [2018-12-02 17:09:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:22,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 17:09:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:22,555 INFO L225 Difference]: With dead ends: 556 [2018-12-02 17:09:22,555 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 17:09:22,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 17:09:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-12-02 17:09:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2018-12-02 17:09:22,566 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 103 [2018-12-02 17:09:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:22,566 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2018-12-02 17:09:22,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2018-12-02 17:09:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 17:09:22,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:22,567 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:22,567 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:22,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -966077022, now seen corresponding path program 1 times [2018-12-02 17:09:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:22,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:22,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:22,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:22,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:22,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:22,604 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2018-12-02 17:09:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:22,751 INFO L93 Difference]: Finished difference Result 522 states and 789 transitions. [2018-12-02 17:09:22,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:22,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 17:09:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:22,751 INFO L225 Difference]: With dead ends: 522 [2018-12-02 17:09:22,752 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 17:09:22,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 17:09:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-12-02 17:09:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2018-12-02 17:09:22,758 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 103 [2018-12-02 17:09:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:22,758 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2018-12-02 17:09:22,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2018-12-02 17:09:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 17:09:22,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:22,758 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:22,758 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:22,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2142909747, now seen corresponding path program 1 times [2018-12-02 17:09:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:22,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:22,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:22,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:22,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:22,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:22,803 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2018-12-02 17:09:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:23,027 INFO L93 Difference]: Finished difference Result 556 states and 836 transitions. [2018-12-02 17:09:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:23,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 17:09:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:23,028 INFO L225 Difference]: With dead ends: 556 [2018-12-02 17:09:23,028 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 17:09:23,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 17:09:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-12-02 17:09:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2018-12-02 17:09:23,034 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 104 [2018-12-02 17:09:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:23,034 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2018-12-02 17:09:23,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2018-12-02 17:09:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 17:09:23,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:23,035 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:23,035 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:23,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash -891140299, now seen corresponding path program 1 times [2018-12-02 17:09:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:23,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:23,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:23,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:23,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:23,064 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2018-12-02 17:09:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:23,212 INFO L93 Difference]: Finished difference Result 522 states and 785 transitions. [2018-12-02 17:09:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:23,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 17:09:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:23,213 INFO L225 Difference]: With dead ends: 522 [2018-12-02 17:09:23,213 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 17:09:23,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 17:09:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-12-02 17:09:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2018-12-02 17:09:23,223 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 104 [2018-12-02 17:09:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:23,224 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2018-12-02 17:09:23,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2018-12-02 17:09:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 17:09:23,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:23,224 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:23,225 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:23,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1551106847, now seen corresponding path program 1 times [2018-12-02 17:09:23,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:23,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:23,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:23,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:23,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:23,271 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2018-12-02 17:09:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:23,471 INFO L93 Difference]: Finished difference Result 556 states and 832 transitions. [2018-12-02 17:09:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:23,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 17:09:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:23,472 INFO L225 Difference]: With dead ends: 556 [2018-12-02 17:09:23,472 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 17:09:23,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 17:09:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2018-12-02 17:09:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2018-12-02 17:09:23,479 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 105 [2018-12-02 17:09:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:23,479 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2018-12-02 17:09:23,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2018-12-02 17:09:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 17:09:23,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:23,480 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:23,480 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:23,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1984835933, now seen corresponding path program 1 times [2018-12-02 17:09:23,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:23,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:23,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:23,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:23,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:23,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:23,516 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2018-12-02 17:09:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:23,679 INFO L93 Difference]: Finished difference Result 522 states and 781 transitions. [2018-12-02 17:09:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:23,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 17:09:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:23,680 INFO L225 Difference]: With dead ends: 522 [2018-12-02 17:09:23,680 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 17:09:23,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 17:09:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2018-12-02 17:09:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2018-12-02 17:09:23,689 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 105 [2018-12-02 17:09:23,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:23,689 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2018-12-02 17:09:23,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2018-12-02 17:09:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 17:09:23,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:23,690 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:23,691 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:23,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 938023950, now seen corresponding path program 1 times [2018-12-02 17:09:23,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:23,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:23,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:23,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:23,725 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2018-12-02 17:09:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:23,921 INFO L93 Difference]: Finished difference Result 546 states and 816 transitions. [2018-12-02 17:09:23,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:23,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-02 17:09:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:23,922 INFO L225 Difference]: With dead ends: 546 [2018-12-02 17:09:23,922 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 17:09:23,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 17:09:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2018-12-02 17:09:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2018-12-02 17:09:23,929 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 106 [2018-12-02 17:09:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:23,929 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2018-12-02 17:09:23,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2018-12-02 17:09:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 17:09:23,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:23,930 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:23,930 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:23,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:23,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1498723728, now seen corresponding path program 1 times [2018-12-02 17:09:23,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:23,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:23,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:23,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:23,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:23,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:23,966 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2018-12-02 17:09:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:24,143 INFO L93 Difference]: Finished difference Result 512 states and 765 transitions. [2018-12-02 17:09:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:24,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-02 17:09:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:24,144 INFO L225 Difference]: With dead ends: 512 [2018-12-02 17:09:24,144 INFO L226 Difference]: Without dead ends: 274 [2018-12-02 17:09:24,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-02 17:09:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-12-02 17:09:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2018-12-02 17:09:24,158 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 106 [2018-12-02 17:09:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:24,159 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2018-12-02 17:09:24,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2018-12-02 17:09:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 17:09:24,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:24,160 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:24,160 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:24,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:24,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1972686726, now seen corresponding path program 1 times [2018-12-02 17:09:24,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:24,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:24,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:24,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:24,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:24,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:24,221 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2018-12-02 17:09:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:24,409 INFO L93 Difference]: Finished difference Result 546 states and 812 transitions. [2018-12-02 17:09:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:24,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-02 17:09:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:24,410 INFO L225 Difference]: With dead ends: 546 [2018-12-02 17:09:24,410 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 17:09:24,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 17:09:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2018-12-02 17:09:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-02 17:09:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2018-12-02 17:09:24,417 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 110 [2018-12-02 17:09:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:24,417 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2018-12-02 17:09:24,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2018-12-02 17:09:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 17:09:24,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:24,418 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:24,418 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:24,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1904883964, now seen corresponding path program 1 times [2018-12-02 17:09:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:24,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:24,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:24,449 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:24,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:24,449 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 4 states. [2018-12-02 17:09:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:24,605 INFO L93 Difference]: Finished difference Result 553 states and 825 transitions. [2018-12-02 17:09:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:24,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-02 17:09:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:24,606 INFO L225 Difference]: With dead ends: 553 [2018-12-02 17:09:24,606 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 17:09:24,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 17:09:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-12-02 17:09:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2018-12-02 17:09:24,613 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 110 [2018-12-02 17:09:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:24,613 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2018-12-02 17:09:24,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2018-12-02 17:09:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 17:09:24,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:24,614 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:24,614 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:24,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1732378698, now seen corresponding path program 1 times [2018-12-02 17:09:24,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:24,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:24,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:24,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:24,656 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 4 states. [2018-12-02 17:09:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:24,845 INFO L93 Difference]: Finished difference Result 598 states and 900 transitions. [2018-12-02 17:09:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:24,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 17:09:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:24,846 INFO L225 Difference]: With dead ends: 598 [2018-12-02 17:09:24,846 INFO L226 Difference]: Without dead ends: 334 [2018-12-02 17:09:24,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-02 17:09:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2018-12-02 17:09:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2018-12-02 17:09:24,854 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 113 [2018-12-02 17:09:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:24,854 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2018-12-02 17:09:24,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2018-12-02 17:09:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 17:09:24,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:24,855 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:24,855 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:24,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1392175577, now seen corresponding path program 1 times [2018-12-02 17:09:24,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:24,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:24,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:24,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:24,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:24,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:24,895 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand 4 states. [2018-12-02 17:09:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:25,064 INFO L93 Difference]: Finished difference Result 590 states and 885 transitions. [2018-12-02 17:09:25,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:25,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-02 17:09:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:25,065 INFO L225 Difference]: With dead ends: 590 [2018-12-02 17:09:25,065 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 17:09:25,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 17:09:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-12-02 17:09:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 430 transitions. [2018-12-02 17:09:25,077 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 430 transitions. Word has length 114 [2018-12-02 17:09:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:25,077 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 430 transitions. [2018-12-02 17:09:25,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 430 transitions. [2018-12-02 17:09:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 17:09:25,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:25,078 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:25,078 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:25,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:25,078 INFO L82 PathProgramCache]: Analyzing trace with hash 682577892, now seen corresponding path program 1 times [2018-12-02 17:09:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:25,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:25,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:25,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:25,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:25,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:25,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:25,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:25,118 INFO L87 Difference]: Start difference. First operand 289 states and 430 transitions. Second operand 4 states. [2018-12-02 17:09:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:25,309 INFO L93 Difference]: Finished difference Result 590 states and 883 transitions. [2018-12-02 17:09:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:25,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 17:09:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:25,310 INFO L225 Difference]: With dead ends: 590 [2018-12-02 17:09:25,310 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 17:09:25,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 17:09:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-12-02 17:09:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2018-12-02 17:09:25,319 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 115 [2018-12-02 17:09:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:25,319 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2018-12-02 17:09:25,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2018-12-02 17:09:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 17:09:25,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:25,320 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:25,320 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:25,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 299610511, now seen corresponding path program 1 times [2018-12-02 17:09:25,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:25,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:25,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:25,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:25,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:25,373 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand 4 states. [2018-12-02 17:09:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:25,563 INFO L93 Difference]: Finished difference Result 590 states and 881 transitions. [2018-12-02 17:09:25,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:25,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 17:09:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:25,564 INFO L225 Difference]: With dead ends: 590 [2018-12-02 17:09:25,564 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 17:09:25,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 17:09:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2018-12-02 17:09:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2018-12-02 17:09:25,572 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 116 [2018-12-02 17:09:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:25,572 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2018-12-02 17:09:25,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2018-12-02 17:09:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 17:09:25,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:25,573 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:25,573 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:25,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1458223853, now seen corresponding path program 1 times [2018-12-02 17:09:25,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:25,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:25,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:25,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:25,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:25,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:25,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:25,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:25,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:25,612 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand 4 states. [2018-12-02 17:09:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:25,820 INFO L93 Difference]: Finished difference Result 588 states and 877 transitions. [2018-12-02 17:09:25,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:25,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 17:09:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:25,821 INFO L225 Difference]: With dead ends: 588 [2018-12-02 17:09:25,821 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 17:09:25,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 17:09:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 289. [2018-12-02 17:09:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2018-12-02 17:09:25,832 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 116 [2018-12-02 17:09:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:25,833 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2018-12-02 17:09:25,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2018-12-02 17:09:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 17:09:25,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:25,833 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:25,833 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:25,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1863324990, now seen corresponding path program 1 times [2018-12-02 17:09:25,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:25,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:25,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:25,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:25,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:25,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:25,879 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand 4 states. [2018-12-02 17:09:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:26,049 INFO L93 Difference]: Finished difference Result 585 states and 871 transitions. [2018-12-02 17:09:26,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:26,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-02 17:09:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:26,050 INFO L225 Difference]: With dead ends: 585 [2018-12-02 17:09:26,050 INFO L226 Difference]: Without dead ends: 321 [2018-12-02 17:09:26,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-02 17:09:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 289. [2018-12-02 17:09:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2018-12-02 17:09:26,059 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 117 [2018-12-02 17:09:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:26,059 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2018-12-02 17:09:26,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2018-12-02 17:09:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-02 17:09:26,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:26,059 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:26,059 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:26,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1328178944, now seen corresponding path program 1 times [2018-12-02 17:09:26,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:26,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:26,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:26,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:26,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:26,092 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand 4 states. [2018-12-02 17:09:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:26,266 INFO L93 Difference]: Finished difference Result 583 states and 866 transitions. [2018-12-02 17:09:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:26,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-02 17:09:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:26,268 INFO L225 Difference]: With dead ends: 583 [2018-12-02 17:09:26,268 INFO L226 Difference]: Without dead ends: 319 [2018-12-02 17:09:26,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-02 17:09:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2018-12-02 17:09:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2018-12-02 17:09:26,277 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 117 [2018-12-02 17:09:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:26,277 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2018-12-02 17:09:26,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2018-12-02 17:09:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 17:09:26,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:26,278 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:26,278 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:26,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 200199204, now seen corresponding path program 1 times [2018-12-02 17:09:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:26,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:26,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:26,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:26,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:26,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:26,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:26,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:26,316 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand 4 states. [2018-12-02 17:09:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:26,492 INFO L93 Difference]: Finished difference Result 583 states and 864 transitions. [2018-12-02 17:09:26,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:26,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 17:09:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:26,494 INFO L225 Difference]: With dead ends: 583 [2018-12-02 17:09:26,494 INFO L226 Difference]: Without dead ends: 319 [2018-12-02 17:09:26,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-02 17:09:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2018-12-02 17:09:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2018-12-02 17:09:26,509 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 119 [2018-12-02 17:09:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:26,509 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2018-12-02 17:09:26,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2018-12-02 17:09:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 17:09:26,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:26,510 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:26,510 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:26,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1628334344, now seen corresponding path program 1 times [2018-12-02 17:09:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:26,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:26,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:26,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:26,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:26,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:26,554 INFO L87 Difference]: Start difference. First operand 289 states and 424 transitions. Second operand 4 states. [2018-12-02 17:09:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:26,727 INFO L93 Difference]: Finished difference Result 579 states and 857 transitions. [2018-12-02 17:09:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:26,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 17:09:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:26,728 INFO L225 Difference]: With dead ends: 579 [2018-12-02 17:09:26,728 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 17:09:26,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 17:09:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-12-02 17:09:26,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2018-12-02 17:09:26,739 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 120 [2018-12-02 17:09:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:26,739 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2018-12-02 17:09:26,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2018-12-02 17:09:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 17:09:26,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:26,740 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:26,740 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:26,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash -982902135, now seen corresponding path program 1 times [2018-12-02 17:09:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:26,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:26,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:26,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:26,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:26,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:26,781 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2018-12-02 17:09:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:26,948 INFO L93 Difference]: Finished difference Result 579 states and 855 transitions. [2018-12-02 17:09:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:26,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 17:09:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:26,949 INFO L225 Difference]: With dead ends: 579 [2018-12-02 17:09:26,950 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 17:09:26,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 17:09:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2018-12-02 17:09:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2018-12-02 17:09:26,958 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 120 [2018-12-02 17:09:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:26,959 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2018-12-02 17:09:26,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2018-12-02 17:09:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 17:09:26,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:26,959 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:26,959 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:26,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash 838983061, now seen corresponding path program 1 times [2018-12-02 17:09:26,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:26,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:26,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:26,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:26,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:26,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:26,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:26,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:26,993 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand 4 states. [2018-12-02 17:09:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:27,156 INFO L93 Difference]: Finished difference Result 577 states and 851 transitions. [2018-12-02 17:09:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:27,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 17:09:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:27,157 INFO L225 Difference]: With dead ends: 577 [2018-12-02 17:09:27,157 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 17:09:27,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 17:09:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-12-02 17:09:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2018-12-02 17:09:27,167 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 121 [2018-12-02 17:09:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:27,167 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2018-12-02 17:09:27,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2018-12-02 17:09:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 17:09:27,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:27,167 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:27,167 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:27,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1215346492, now seen corresponding path program 1 times [2018-12-02 17:09:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:27,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:27,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:27,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:27,204 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 4 states. [2018-12-02 17:09:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:27,362 INFO L93 Difference]: Finished difference Result 577 states and 849 transitions. [2018-12-02 17:09:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:27,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 17:09:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:27,363 INFO L225 Difference]: With dead ends: 577 [2018-12-02 17:09:27,363 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 17:09:27,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 17:09:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-12-02 17:09:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2018-12-02 17:09:27,373 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 122 [2018-12-02 17:09:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:27,373 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2018-12-02 17:09:27,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2018-12-02 17:09:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 17:09:27,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:27,373 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:27,373 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:27,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:27,374 INFO L82 PathProgramCache]: Analyzing trace with hash -58479568, now seen corresponding path program 1 times [2018-12-02 17:09:27,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:27,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:27,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:27,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:27,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:27,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:27,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:27,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:27,411 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand 4 states. [2018-12-02 17:09:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:27,663 INFO L93 Difference]: Finished difference Result 575 states and 845 transitions. [2018-12-02 17:09:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:27,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 17:09:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:27,664 INFO L225 Difference]: With dead ends: 575 [2018-12-02 17:09:27,664 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 17:09:27,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 17:09:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2018-12-02 17:09:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-02 17:09:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2018-12-02 17:09:27,673 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 123 [2018-12-02 17:09:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:27,673 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2018-12-02 17:09:27,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2018-12-02 17:09:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 17:09:27,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:27,674 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:27,674 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash 53056622, now seen corresponding path program 1 times [2018-12-02 17:09:27,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:27,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 17:09:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:27,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:27,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:27,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:27,710 INFO L87 Difference]: Start difference. First operand 289 states and 419 transitions. Second operand 4 states. [2018-12-02 17:09:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:27,902 INFO L93 Difference]: Finished difference Result 624 states and 920 transitions. [2018-12-02 17:09:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:27,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 17:09:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:27,903 INFO L225 Difference]: With dead ends: 624 [2018-12-02 17:09:27,904 INFO L226 Difference]: Without dead ends: 360 [2018-12-02 17:09:27,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-12-02 17:09:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 321. [2018-12-02 17:09:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-02 17:09:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 476 transitions. [2018-12-02 17:09:27,913 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 476 transitions. Word has length 123 [2018-12-02 17:09:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:27,914 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 476 transitions. [2018-12-02 17:09:27,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 476 transitions. [2018-12-02 17:09:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 17:09:27,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:27,914 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:27,914 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:27,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash 373763920, now seen corresponding path program 1 times [2018-12-02 17:09:27,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:27,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:27,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:27,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:27,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:27,947 INFO L87 Difference]: Start difference. First operand 321 states and 476 transitions. Second operand 4 states. [2018-12-02 17:09:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:28,452 INFO L93 Difference]: Finished difference Result 723 states and 1088 transitions. [2018-12-02 17:09:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:28,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 17:09:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:28,455 INFO L225 Difference]: With dead ends: 723 [2018-12-02 17:09:28,455 INFO L226 Difference]: Without dead ends: 427 [2018-12-02 17:09:28,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-12-02 17:09:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 360. [2018-12-02 17:09:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 17:09:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2018-12-02 17:09:28,477 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 124 [2018-12-02 17:09:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:28,477 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2018-12-02 17:09:28,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2018-12-02 17:09:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 17:09:28,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:28,478 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:28,479 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:28,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash 448437291, now seen corresponding path program 1 times [2018-12-02 17:09:28,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:28,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:28,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:28,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:28,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:28,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:28,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:28,512 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2018-12-02 17:09:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:28,706 INFO L93 Difference]: Finished difference Result 721 states and 1099 transitions. [2018-12-02 17:09:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:28,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 17:09:28,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:28,710 INFO L225 Difference]: With dead ends: 721 [2018-12-02 17:09:28,710 INFO L226 Difference]: Without dead ends: 386 [2018-12-02 17:09:28,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-02 17:09:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2018-12-02 17:09:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 17:09:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2018-12-02 17:09:28,733 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 125 [2018-12-02 17:09:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:28,733 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2018-12-02 17:09:28,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2018-12-02 17:09:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 17:09:28,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:28,734 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:28,735 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:28,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1045783778, now seen corresponding path program 1 times [2018-12-02 17:09:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:28,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:28,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:28,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:28,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:28,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:28,773 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 4 states. [2018-12-02 17:09:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:29,009 INFO L93 Difference]: Finished difference Result 754 states and 1145 transitions. [2018-12-02 17:09:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:29,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 17:09:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:29,010 INFO L225 Difference]: With dead ends: 754 [2018-12-02 17:09:29,010 INFO L226 Difference]: Without dead ends: 419 [2018-12-02 17:09:29,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:29,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-12-02 17:09:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2018-12-02 17:09:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 17:09:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2018-12-02 17:09:29,022 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 125 [2018-12-02 17:09:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:29,023 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2018-12-02 17:09:29,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2018-12-02 17:09:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 17:09:29,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:29,023 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:29,024 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:29,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:29,024 INFO L82 PathProgramCache]: Analyzing trace with hash 9130444, now seen corresponding path program 1 times [2018-12-02 17:09:29,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:29,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:29,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:29,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:29,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:29,063 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2018-12-02 17:09:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:29,229 INFO L93 Difference]: Finished difference Result 719 states and 1095 transitions. [2018-12-02 17:09:29,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:29,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-02 17:09:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:29,230 INFO L225 Difference]: With dead ends: 719 [2018-12-02 17:09:29,230 INFO L226 Difference]: Without dead ends: 385 [2018-12-02 17:09:29,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-02 17:09:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2018-12-02 17:09:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 17:09:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2018-12-02 17:09:29,242 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 126 [2018-12-02 17:09:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:29,242 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2018-12-02 17:09:29,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2018-12-02 17:09:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 17:09:29,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:29,242 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:29,242 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:29,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:29,243 INFO L82 PathProgramCache]: Analyzing trace with hash -171542106, now seen corresponding path program 1 times [2018-12-02 17:09:29,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:29,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:29,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:29,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:29,278 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2018-12-02 17:09:29,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:29,526 INFO L93 Difference]: Finished difference Result 719 states and 1093 transitions. [2018-12-02 17:09:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:29,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 17:09:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:29,528 INFO L225 Difference]: With dead ends: 719 [2018-12-02 17:09:29,528 INFO L226 Difference]: Without dead ends: 385 [2018-12-02 17:09:29,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-02 17:09:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2018-12-02 17:09:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 17:09:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2018-12-02 17:09:29,551 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 127 [2018-12-02 17:09:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:29,551 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2018-12-02 17:09:29,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2018-12-02 17:09:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 17:09:29,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:29,552 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:29,552 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:29,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash -924486041, now seen corresponding path program 1 times [2018-12-02 17:09:29,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:29,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:29,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:29,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:29,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:29,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:29,585 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand 4 states. [2018-12-02 17:09:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:29,742 INFO L93 Difference]: Finished difference Result 709 states and 1079 transitions. [2018-12-02 17:09:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:29,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-02 17:09:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:29,743 INFO L225 Difference]: With dead ends: 709 [2018-12-02 17:09:29,743 INFO L226 Difference]: Without dead ends: 375 [2018-12-02 17:09:29,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-02 17:09:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2018-12-02 17:09:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 17:09:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2018-12-02 17:09:29,754 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 128 [2018-12-02 17:09:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:29,754 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2018-12-02 17:09:29,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2018-12-02 17:09:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 17:09:29,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:29,755 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:29,755 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:29,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash -629615499, now seen corresponding path program 1 times [2018-12-02 17:09:29,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:29,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:29,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:29,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:29,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:29,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:29,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:29,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:29,800 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2018-12-02 17:09:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:30,049 INFO L93 Difference]: Finished difference Result 799 states and 1220 transitions. [2018-12-02 17:09:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:30,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-02 17:09:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:30,050 INFO L225 Difference]: With dead ends: 799 [2018-12-02 17:09:30,050 INFO L226 Difference]: Without dead ends: 465 [2018-12-02 17:09:30,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-02 17:09:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2018-12-02 17:09:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-02 17:09:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 613 transitions. [2018-12-02 17:09:30,064 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 613 transitions. Word has length 129 [2018-12-02 17:09:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:30,064 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 613 transitions. [2018-12-02 17:09:30,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2018-12-02 17:09:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 17:09:30,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:30,065 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:30,065 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:30,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash 5792861, now seen corresponding path program 1 times [2018-12-02 17:09:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:30,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:30,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:30,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:30,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:30,107 INFO L87 Difference]: Start difference. First operand 398 states and 613 transitions. Second operand 4 states. [2018-12-02 17:09:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:30,349 INFO L93 Difference]: Finished difference Result 830 states and 1279 transitions. [2018-12-02 17:09:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:30,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-02 17:09:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:30,350 INFO L225 Difference]: With dead ends: 830 [2018-12-02 17:09:30,350 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 17:09:30,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 17:09:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 359. [2018-12-02 17:09:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 17:09:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2018-12-02 17:09:30,362 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 130 [2018-12-02 17:09:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:30,362 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2018-12-02 17:09:30,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2018-12-02 17:09:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 17:09:30,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:30,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:30,363 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:30,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1887304737, now seen corresponding path program 1 times [2018-12-02 17:09:30,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 17:09:30,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:30,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:30,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:30,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:30,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:30,411 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2018-12-02 17:09:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:30,568 INFO L93 Difference]: Finished difference Result 708 states and 1076 transitions. [2018-12-02 17:09:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:30,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-02 17:09:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:30,569 INFO L225 Difference]: With dead ends: 708 [2018-12-02 17:09:30,569 INFO L226 Difference]: Without dead ends: 374 [2018-12-02 17:09:30,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-02 17:09:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2018-12-02 17:09:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 17:09:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 545 transitions. [2018-12-02 17:09:30,582 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 545 transitions. Word has length 131 [2018-12-02 17:09:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:30,582 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 545 transitions. [2018-12-02 17:09:30,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 545 transitions. [2018-12-02 17:09:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 17:09:30,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:30,582 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:30,582 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:30,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2079412615, now seen corresponding path program 1 times [2018-12-02 17:09:30,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 17:09:30,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:30,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:30,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:30,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:30,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:30,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:30,613 INFO L87 Difference]: Start difference. First operand 362 states and 545 transitions. Second operand 4 states. [2018-12-02 17:09:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:30,769 INFO L93 Difference]: Finished difference Result 715 states and 1083 transitions. [2018-12-02 17:09:30,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:30,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 17:09:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:30,770 INFO L225 Difference]: With dead ends: 715 [2018-12-02 17:09:30,770 INFO L226 Difference]: Without dead ends: 378 [2018-12-02 17:09:30,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-02 17:09:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 362. [2018-12-02 17:09:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 17:09:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2018-12-02 17:09:30,784 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 138 [2018-12-02 17:09:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:30,784 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2018-12-02 17:09:30,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2018-12-02 17:09:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 17:09:30,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:30,785 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:30,785 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:30,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1036930904, now seen corresponding path program 1 times [2018-12-02 17:09:30,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:30,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:30,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:30,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:30,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:30,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:30,820 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand 4 states. [2018-12-02 17:09:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:31,020 INFO L93 Difference]: Finished difference Result 761 states and 1156 transitions. [2018-12-02 17:09:31,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:31,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 17:09:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:31,021 INFO L225 Difference]: With dead ends: 761 [2018-12-02 17:09:31,021 INFO L226 Difference]: Without dead ends: 424 [2018-12-02 17:09:31,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-02 17:09:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 390. [2018-12-02 17:09:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-02 17:09:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 593 transitions. [2018-12-02 17:09:31,034 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 593 transitions. Word has length 138 [2018-12-02 17:09:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:31,034 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 593 transitions. [2018-12-02 17:09:31,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 593 transitions. [2018-12-02 17:09:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 17:09:31,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:31,034 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:31,034 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:31,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:31,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1517125560, now seen corresponding path program 1 times [2018-12-02 17:09:31,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 17:09:31,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:31,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:31,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:31,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:31,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:31,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:31,065 INFO L87 Difference]: Start difference. First operand 390 states and 593 transitions. Second operand 4 states. [2018-12-02 17:09:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:31,230 INFO L93 Difference]: Finished difference Result 769 states and 1177 transitions. [2018-12-02 17:09:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:31,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-02 17:09:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:31,232 INFO L225 Difference]: With dead ends: 769 [2018-12-02 17:09:31,232 INFO L226 Difference]: Without dead ends: 404 [2018-12-02 17:09:31,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-12-02 17:09:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 390. [2018-12-02 17:09:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-02 17:09:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 592 transitions. [2018-12-02 17:09:31,246 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 592 transitions. Word has length 139 [2018-12-02 17:09:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:31,246 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 592 transitions. [2018-12-02 17:09:31,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 592 transitions. [2018-12-02 17:09:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 17:09:31,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:31,247 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:31,247 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:31,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 361739095, now seen corresponding path program 1 times [2018-12-02 17:09:31,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:31,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:31,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:31,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:31,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:31,288 INFO L87 Difference]: Start difference. First operand 390 states and 592 transitions. Second operand 4 states. [2018-12-02 17:09:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:31,519 INFO L93 Difference]: Finished difference Result 853 states and 1307 transitions. [2018-12-02 17:09:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:31,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-02 17:09:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:31,520 INFO L225 Difference]: With dead ends: 853 [2018-12-02 17:09:31,520 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:31,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 402. [2018-12-02 17:09:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-02 17:09:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 609 transitions. [2018-12-02 17:09:31,534 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 609 transitions. Word has length 139 [2018-12-02 17:09:31,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:31,534 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 609 transitions. [2018-12-02 17:09:31,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:31,535 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 609 transitions. [2018-12-02 17:09:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 17:09:31,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:31,535 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:31,535 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:31,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:31,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1616453664, now seen corresponding path program 1 times [2018-12-02 17:09:31,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:31,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:31,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:31,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:31,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:31,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:31,577 INFO L87 Difference]: Start difference. First operand 402 states and 609 transitions. Second operand 4 states. [2018-12-02 17:09:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:31,803 INFO L93 Difference]: Finished difference Result 865 states and 1323 transitions. [2018-12-02 17:09:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:31,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-02 17:09:31,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:31,805 INFO L225 Difference]: With dead ends: 865 [2018-12-02 17:09:31,805 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:31,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:31,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 403. [2018-12-02 17:09:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-02 17:09:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 610 transitions. [2018-12-02 17:09:31,819 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 610 transitions. Word has length 140 [2018-12-02 17:09:31,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:31,819 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 610 transitions. [2018-12-02 17:09:31,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 610 transitions. [2018-12-02 17:09:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 17:09:31,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:31,820 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:31,820 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:31,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:31,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1884129838, now seen corresponding path program 1 times [2018-12-02 17:09:31,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:31,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:31,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:31,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:31,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:31,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:31,849 INFO L87 Difference]: Start difference. First operand 403 states and 610 transitions. Second operand 4 states. [2018-12-02 17:09:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:32,069 INFO L93 Difference]: Finished difference Result 866 states and 1323 transitions. [2018-12-02 17:09:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:32,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-02 17:09:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:32,071 INFO L225 Difference]: With dead ends: 866 [2018-12-02 17:09:32,071 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:32,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 404. [2018-12-02 17:09:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-12-02 17:09:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 611 transitions. [2018-12-02 17:09:32,086 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 611 transitions. Word has length 141 [2018-12-02 17:09:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:32,087 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 611 transitions. [2018-12-02 17:09:32,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 611 transitions. [2018-12-02 17:09:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 17:09:32,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:32,088 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:32,088 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:32,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1819869115, now seen corresponding path program 1 times [2018-12-02 17:09:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:32,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:32,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:32,121 INFO L87 Difference]: Start difference. First operand 404 states and 611 transitions. Second operand 4 states. [2018-12-02 17:09:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:32,340 INFO L93 Difference]: Finished difference Result 857 states and 1311 transitions. [2018-12-02 17:09:32,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:32,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-02 17:09:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:32,341 INFO L225 Difference]: With dead ends: 857 [2018-12-02 17:09:32,341 INFO L226 Difference]: Without dead ends: 478 [2018-12-02 17:09:32,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-02 17:09:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 405. [2018-12-02 17:09:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-02 17:09:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2018-12-02 17:09:32,356 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 142 [2018-12-02 17:09:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:32,356 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2018-12-02 17:09:32,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2018-12-02 17:09:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 17:09:32,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:32,357 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:32,357 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:32,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -413892718, now seen corresponding path program 1 times [2018-12-02 17:09:32,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:32,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:32,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:32,387 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 4 states. [2018-12-02 17:09:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:32,655 INFO L93 Difference]: Finished difference Result 868 states and 1323 transitions. [2018-12-02 17:09:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:32,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-02 17:09:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:32,656 INFO L225 Difference]: With dead ends: 868 [2018-12-02 17:09:32,657 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:32,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-12-02 17:09:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-02 17:09:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2018-12-02 17:09:32,675 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 144 [2018-12-02 17:09:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:32,675 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2018-12-02 17:09:32,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2018-12-02 17:09:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 17:09:32,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:32,676 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:32,676 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:32,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -953296059, now seen corresponding path program 1 times [2018-12-02 17:09:32,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:32,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:32,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:32,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:32,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:32,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:32,713 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 4 states. [2018-12-02 17:09:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:33,034 INFO L93 Difference]: Finished difference Result 868 states and 1321 transitions. [2018-12-02 17:09:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:33,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 17:09:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:33,037 INFO L225 Difference]: With dead ends: 868 [2018-12-02 17:09:33,037 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-12-02 17:09:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-02 17:09:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2018-12-02 17:09:33,068 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 145 [2018-12-02 17:09:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:33,068 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2018-12-02 17:09:33,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2018-12-02 17:09:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 17:09:33,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:33,069 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:33,069 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:33,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:33,070 INFO L82 PathProgramCache]: Analyzing trace with hash 58007373, now seen corresponding path program 1 times [2018-12-02 17:09:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:33,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:33,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:33,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:33,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:33,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:33,107 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 4 states. [2018-12-02 17:09:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:33,397 INFO L93 Difference]: Finished difference Result 868 states and 1319 transitions. [2018-12-02 17:09:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:33,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-02 17:09:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:33,399 INFO L225 Difference]: With dead ends: 868 [2018-12-02 17:09:33,399 INFO L226 Difference]: Without dead ends: 488 [2018-12-02 17:09:33,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-02 17:09:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2018-12-02 17:09:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-12-02 17:09:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2018-12-02 17:09:33,425 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 146 [2018-12-02 17:09:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:33,426 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2018-12-02 17:09:33,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2018-12-02 17:09:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 17:09:33,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:33,426 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:33,427 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:33,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1896580512, now seen corresponding path program 1 times [2018-12-02 17:09:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:33,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:33,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:33,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:33,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:33,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:33,470 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 4 states. [2018-12-02 17:09:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:33,751 INFO L93 Difference]: Finished difference Result 858 states and 1305 transitions. [2018-12-02 17:09:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:33,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-02 17:09:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:33,753 INFO L225 Difference]: With dead ends: 858 [2018-12-02 17:09:33,753 INFO L226 Difference]: Without dead ends: 478 [2018-12-02 17:09:33,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-02 17:09:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2018-12-02 17:09:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-02 17:09:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 588 transitions. [2018-12-02 17:09:33,770 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 588 transitions. Word has length 147 [2018-12-02 17:09:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:33,770 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 588 transitions. [2018-12-02 17:09:33,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 588 transitions. [2018-12-02 17:09:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 17:09:33,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:33,771 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:33,772 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:33,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:33,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1580724227, now seen corresponding path program 1 times [2018-12-02 17:09:33,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:33,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:33,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:33,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:33,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:33,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:33,820 INFO L87 Difference]: Start difference. First operand 390 states and 588 transitions. Second operand 4 states. [2018-12-02 17:09:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:34,042 INFO L93 Difference]: Finished difference Result 843 states and 1283 transitions. [2018-12-02 17:09:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:34,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-02 17:09:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:34,043 INFO L225 Difference]: With dead ends: 843 [2018-12-02 17:09:34,043 INFO L226 Difference]: Without dead ends: 478 [2018-12-02 17:09:34,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-02 17:09:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 418. [2018-12-02 17:09:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-12-02 17:09:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2018-12-02 17:09:34,060 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 149 [2018-12-02 17:09:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:34,060 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2018-12-02 17:09:34,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2018-12-02 17:09:34,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 17:09:34,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:34,061 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:34,061 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:34,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1765200006, now seen corresponding path program 1 times [2018-12-02 17:09:34,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:34,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:34,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:34,096 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:34,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:34,097 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:34,297 INFO L93 Difference]: Finished difference Result 863 states and 1314 transitions. [2018-12-02 17:09:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:34,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-02 17:09:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:34,298 INFO L225 Difference]: With dead ends: 863 [2018-12-02 17:09:34,298 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 17:09:34,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 17:09:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2018-12-02 17:09:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 17:09:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-12-02 17:09:34,315 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 150 [2018-12-02 17:09:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:34,316 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-12-02 17:09:34,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-12-02 17:09:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 17:09:34,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:34,316 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:34,316 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:34,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1251319501, now seen corresponding path program 1 times [2018-12-02 17:09:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:34,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 17:09:34,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:34,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:34,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:34,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:34,351 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:34,550 INFO L93 Difference]: Finished difference Result 864 states and 1314 transitions. [2018-12-02 17:09:34,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:34,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 17:09:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:34,551 INFO L225 Difference]: With dead ends: 864 [2018-12-02 17:09:34,551 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 17:09:34,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 17:09:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2018-12-02 17:09:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 17:09:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 633 transitions. [2018-12-02 17:09:34,576 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 633 transitions. Word has length 152 [2018-12-02 17:09:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:34,576 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 633 transitions. [2018-12-02 17:09:34,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 633 transitions. [2018-12-02 17:09:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 17:09:34,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:34,576 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:34,577 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:34,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1690606052, now seen corresponding path program 1 times [2018-12-02 17:09:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 17:09:34,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:34,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:34,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:34,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:34,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:34,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:34,614 INFO L87 Difference]: Start difference. First operand 419 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:34,816 INFO L93 Difference]: Finished difference Result 862 states and 1310 transitions. [2018-12-02 17:09:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:34,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 17:09:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:34,817 INFO L225 Difference]: With dead ends: 862 [2018-12-02 17:09:34,817 INFO L226 Difference]: Without dead ends: 468 [2018-12-02 17:09:34,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-02 17:09:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 419. [2018-12-02 17:09:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 17:09:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 632 transitions. [2018-12-02 17:09:34,837 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 632 transitions. Word has length 153 [2018-12-02 17:09:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:34,837 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 632 transitions. [2018-12-02 17:09:34,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 632 transitions. [2018-12-02 17:09:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 17:09:34,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:34,838 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:34,838 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:34,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash -172955403, now seen corresponding path program 1 times [2018-12-02 17:09:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:34,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:34,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:34,874 INFO L87 Difference]: Start difference. First operand 419 states and 632 transitions. Second operand 4 states. [2018-12-02 17:09:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:35,078 INFO L93 Difference]: Finished difference Result 859 states and 1304 transitions. [2018-12-02 17:09:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:35,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 17:09:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:35,079 INFO L225 Difference]: With dead ends: 859 [2018-12-02 17:09:35,079 INFO L226 Difference]: Without dead ends: 465 [2018-12-02 17:09:35,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-02 17:09:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 422. [2018-12-02 17:09:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 17:09:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2018-12-02 17:09:35,098 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 153 [2018-12-02 17:09:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:35,098 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2018-12-02 17:09:35,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2018-12-02 17:09:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 17:09:35,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:35,098 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:35,099 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:35,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash -480815361, now seen corresponding path program 1 times [2018-12-02 17:09:35,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:35,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:35,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:35,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:35,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:35,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:35,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:35,129 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2018-12-02 17:09:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:35,394 INFO L93 Difference]: Finished difference Result 853 states and 1292 transitions. [2018-12-02 17:09:35,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:35,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 17:09:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:35,396 INFO L225 Difference]: With dead ends: 853 [2018-12-02 17:09:35,396 INFO L226 Difference]: Without dead ends: 456 [2018-12-02 17:09:35,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-12-02 17:09:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2018-12-02 17:09:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 17:09:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2018-12-02 17:09:35,421 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 153 [2018-12-02 17:09:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2018-12-02 17:09:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2018-12-02 17:09:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 17:09:35,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:35,422 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:35,422 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:35,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1649209736, now seen corresponding path program 1 times [2018-12-02 17:09:35,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:35,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:35,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:35,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:35,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:35,456 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 4 states. [2018-12-02 17:09:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:35,736 INFO L93 Difference]: Finished difference Result 875 states and 1325 transitions. [2018-12-02 17:09:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:35,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 17:09:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:35,738 INFO L225 Difference]: With dead ends: 875 [2018-12-02 17:09:35,738 INFO L226 Difference]: Without dead ends: 478 [2018-12-02 17:09:35,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-02 17:09:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2018-12-02 17:09:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 17:09:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 635 transitions. [2018-12-02 17:09:35,769 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 635 transitions. Word has length 154 [2018-12-02 17:09:35,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:35,769 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 635 transitions. [2018-12-02 17:09:35,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 635 transitions. [2018-12-02 17:09:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 17:09:35,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:35,769 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:35,770 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:35,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1267069304, now seen corresponding path program 1 times [2018-12-02 17:09:35,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:35,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:35,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:35,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:35,806 INFO L87 Difference]: Start difference. First operand 422 states and 635 transitions. Second operand 4 states. [2018-12-02 17:09:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:36,014 INFO L93 Difference]: Finished difference Result 853 states and 1288 transitions. [2018-12-02 17:09:36,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:36,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 17:09:36,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:36,015 INFO L225 Difference]: With dead ends: 853 [2018-12-02 17:09:36,015 INFO L226 Difference]: Without dead ends: 456 [2018-12-02 17:09:36,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-12-02 17:09:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2018-12-02 17:09:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 17:09:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 634 transitions. [2018-12-02 17:09:36,036 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 634 transitions. Word has length 154 [2018-12-02 17:09:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:36,037 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 634 transitions. [2018-12-02 17:09:36,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 634 transitions. [2018-12-02 17:09:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 17:09:36,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:36,037 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:36,037 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:36,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:36,038 INFO L82 PathProgramCache]: Analyzing trace with hash -357850773, now seen corresponding path program 1 times [2018-12-02 17:09:36,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:36,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:36,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:36,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:36,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:36,074 INFO L87 Difference]: Start difference. First operand 422 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:36,295 INFO L93 Difference]: Finished difference Result 867 states and 1308 transitions. [2018-12-02 17:09:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:36,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 17:09:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:36,297 INFO L225 Difference]: With dead ends: 867 [2018-12-02 17:09:36,297 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 17:09:36,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 17:09:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 422. [2018-12-02 17:09:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 17:09:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 633 transitions. [2018-12-02 17:09:36,318 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 633 transitions. Word has length 155 [2018-12-02 17:09:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:36,318 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 633 transitions. [2018-12-02 17:09:36,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 633 transitions. [2018-12-02 17:09:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 17:09:36,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:36,319 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:36,319 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:36,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1147734423, now seen corresponding path program 1 times [2018-12-02 17:09:36,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:36,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:36,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:36,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:36,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:36,362 INFO L87 Difference]: Start difference. First operand 422 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:36,574 INFO L93 Difference]: Finished difference Result 862 states and 1300 transitions. [2018-12-02 17:09:36,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:36,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 17:09:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:36,575 INFO L225 Difference]: With dead ends: 862 [2018-12-02 17:09:36,575 INFO L226 Difference]: Without dead ends: 465 [2018-12-02 17:09:36,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-02 17:09:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 423. [2018-12-02 17:09:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-02 17:09:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 634 transitions. [2018-12-02 17:09:36,604 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 634 transitions. Word has length 155 [2018-12-02 17:09:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:36,605 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 634 transitions. [2018-12-02 17:09:36,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 634 transitions. [2018-12-02 17:09:36,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 17:09:36,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:36,605 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:36,605 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:36,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash 169856890, now seen corresponding path program 1 times [2018-12-02 17:09:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:36,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:36,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:36,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:36,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:36,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:36,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:36,644 INFO L87 Difference]: Start difference. First operand 423 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:36,888 INFO L93 Difference]: Finished difference Result 855 states and 1286 transitions. [2018-12-02 17:09:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:36,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 17:09:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:36,890 INFO L225 Difference]: With dead ends: 855 [2018-12-02 17:09:36,890 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 17:09:36,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 17:09:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2018-12-02 17:09:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-02 17:09:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 633 transitions. [2018-12-02 17:09:36,914 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 633 transitions. Word has length 155 [2018-12-02 17:09:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:36,914 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 633 transitions. [2018-12-02 17:09:36,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 633 transitions. [2018-12-02 17:09:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 17:09:36,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:36,915 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:36,915 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:36,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1975453669, now seen corresponding path program 1 times [2018-12-02 17:09:36,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:36,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:36,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:36,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:36,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:36,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:36,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:36,951 INFO L87 Difference]: Start difference. First operand 423 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:37,158 INFO L93 Difference]: Finished difference Result 859 states and 1293 transitions. [2018-12-02 17:09:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:37,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 17:09:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:37,160 INFO L225 Difference]: With dead ends: 859 [2018-12-02 17:09:37,160 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 17:09:37,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 17:09:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 424. [2018-12-02 17:09:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-02 17:09:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 634 transitions. [2018-12-02 17:09:37,184 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 634 transitions. Word has length 156 [2018-12-02 17:09:37,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:37,185 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 634 transitions. [2018-12-02 17:09:37,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 634 transitions. [2018-12-02 17:09:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 17:09:37,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:37,185 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:37,185 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1674081418, now seen corresponding path program 1 times [2018-12-02 17:09:37,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:37,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:37,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:37,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:37,220 INFO L87 Difference]: Start difference. First operand 424 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:37,419 INFO L93 Difference]: Finished difference Result 860 states and 1293 transitions. [2018-12-02 17:09:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:37,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 17:09:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:37,420 INFO L225 Difference]: With dead ends: 860 [2018-12-02 17:09:37,420 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 17:09:37,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 17:09:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2018-12-02 17:09:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 17:09:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 635 transitions. [2018-12-02 17:09:37,441 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 635 transitions. Word has length 156 [2018-12-02 17:09:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:37,441 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 635 transitions. [2018-12-02 17:09:37,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 635 transitions. [2018-12-02 17:09:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 17:09:37,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:37,442 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:37,442 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1068948243, now seen corresponding path program 1 times [2018-12-02 17:09:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:37,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:37,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:37,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:37,487 INFO L87 Difference]: Start difference. First operand 425 states and 635 transitions. Second operand 4 states. [2018-12-02 17:09:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:37,671 INFO L93 Difference]: Finished difference Result 849 states and 1276 transitions. [2018-12-02 17:09:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:37,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 17:09:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:37,672 INFO L225 Difference]: With dead ends: 849 [2018-12-02 17:09:37,672 INFO L226 Difference]: Without dead ends: 449 [2018-12-02 17:09:37,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-02 17:09:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-12-02 17:09:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 17:09:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 634 transitions. [2018-12-02 17:09:37,693 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 634 transitions. Word has length 156 [2018-12-02 17:09:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:37,694 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 634 transitions. [2018-12-02 17:09:37,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 634 transitions. [2018-12-02 17:09:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 17:09:37,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:37,694 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:37,694 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:37,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1108986482, now seen corresponding path program 1 times [2018-12-02 17:09:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 17:09:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:37,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:37,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:37,736 INFO L87 Difference]: Start difference. First operand 425 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:37,950 INFO L93 Difference]: Finished difference Result 870 states and 1302 transitions. [2018-12-02 17:09:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:37,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 17:09:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:37,951 INFO L225 Difference]: With dead ends: 870 [2018-12-02 17:09:37,951 INFO L226 Difference]: Without dead ends: 470 [2018-12-02 17:09:37,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-02 17:09:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 425. [2018-12-02 17:09:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 17:09:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 633 transitions. [2018-12-02 17:09:37,974 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 633 transitions. Word has length 157 [2018-12-02 17:09:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:37,974 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 633 transitions. [2018-12-02 17:09:37,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 633 transitions. [2018-12-02 17:09:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 17:09:37,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:37,975 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:37,975 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:37,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 887261768, now seen corresponding path program 1 times [2018-12-02 17:09:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:37,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:38,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:38,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:38,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:38,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:38,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:38,014 INFO L87 Difference]: Start difference. First operand 425 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:38,218 INFO L93 Difference]: Finished difference Result 859 states and 1287 transitions. [2018-12-02 17:09:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:38,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 17:09:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:38,219 INFO L225 Difference]: With dead ends: 859 [2018-12-02 17:09:38,219 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 17:09:38,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 17:09:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 426. [2018-12-02 17:09:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-02 17:09:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 634 transitions. [2018-12-02 17:09:38,243 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 634 transitions. Word has length 157 [2018-12-02 17:09:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:38,243 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 634 transitions. [2018-12-02 17:09:38,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 634 transitions. [2018-12-02 17:09:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 17:09:38,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:38,244 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:38,244 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:38,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1573249759, now seen corresponding path program 1 times [2018-12-02 17:09:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:38,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 17:09:38,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:38,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:38,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:38,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:38,278 INFO L87 Difference]: Start difference. First operand 426 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:38,488 INFO L93 Difference]: Finished difference Result 869 states and 1298 transitions. [2018-12-02 17:09:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:38,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 17:09:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:38,489 INFO L225 Difference]: With dead ends: 869 [2018-12-02 17:09:38,489 INFO L226 Difference]: Without dead ends: 468 [2018-12-02 17:09:38,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-02 17:09:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 426. [2018-12-02 17:09:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-02 17:09:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2018-12-02 17:09:38,511 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 158 [2018-12-02 17:09:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:38,511 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2018-12-02 17:09:38,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2018-12-02 17:09:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 17:09:38,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:38,512 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:38,512 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:38,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:38,512 INFO L82 PathProgramCache]: Analyzing trace with hash -290311696, now seen corresponding path program 1 times [2018-12-02 17:09:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:38,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:38,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:38,548 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:38,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:38,549 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:38,773 INFO L93 Difference]: Finished difference Result 866 states and 1292 transitions. [2018-12-02 17:09:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:38,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 17:09:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:38,774 INFO L225 Difference]: With dead ends: 866 [2018-12-02 17:09:38,774 INFO L226 Difference]: Without dead ends: 465 [2018-12-02 17:09:38,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-02 17:09:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2018-12-02 17:09:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-02 17:09:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 632 transitions. [2018-12-02 17:09:38,797 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 632 transitions. Word has length 158 [2018-12-02 17:09:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:38,797 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 632 transitions. [2018-12-02 17:09:38,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 632 transitions. [2018-12-02 17:09:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 17:09:38,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:38,798 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:38,798 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:38,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash 281293425, now seen corresponding path program 1 times [2018-12-02 17:09:38,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:38,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:38,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:38,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:38,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:38,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:38,833 INFO L87 Difference]: Start difference. First operand 426 states and 632 transitions. Second operand 4 states. [2018-12-02 17:09:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:39,050 INFO L93 Difference]: Finished difference Result 860 states and 1283 transitions. [2018-12-02 17:09:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:39,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 17:09:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:39,051 INFO L225 Difference]: With dead ends: 860 [2018-12-02 17:09:39,051 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 17:09:39,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 17:09:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 427. [2018-12-02 17:09:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-02 17:09:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 633 transitions. [2018-12-02 17:09:39,078 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 633 transitions. Word has length 158 [2018-12-02 17:09:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:39,078 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 633 transitions. [2018-12-02 17:09:39,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2018-12-02 17:09:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 17:09:39,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:39,079 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:39,079 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:39,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash -907282397, now seen corresponding path program 1 times [2018-12-02 17:09:39,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:39,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 17:09:39,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:39,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:39,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:39,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:39,119 INFO L87 Difference]: Start difference. First operand 427 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:39,317 INFO L93 Difference]: Finished difference Result 859 states and 1281 transitions. [2018-12-02 17:09:39,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:39,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 17:09:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:39,318 INFO L225 Difference]: With dead ends: 859 [2018-12-02 17:09:39,318 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 17:09:39,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 17:09:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 428. [2018-12-02 17:09:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2018-12-02 17:09:39,341 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 159 [2018-12-02 17:09:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:39,341 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2018-12-02 17:09:39,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2018-12-02 17:09:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 17:09:39,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:39,341 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:39,341 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:39,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash 37486546, now seen corresponding path program 1 times [2018-12-02 17:09:39,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:39,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:39,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:39,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:39,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:39,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:39,375 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand 4 states. [2018-12-02 17:09:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:39,584 INFO L93 Difference]: Finished difference Result 868 states and 1290 transitions. [2018-12-02 17:09:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:39,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-02 17:09:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:39,585 INFO L225 Difference]: With dead ends: 868 [2018-12-02 17:09:39,585 INFO L226 Difference]: Without dead ends: 465 [2018-12-02 17:09:39,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-12-02 17:09:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 428. [2018-12-02 17:09:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2018-12-02 17:09:39,609 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 160 [2018-12-02 17:09:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:39,609 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2018-12-02 17:09:39,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2018-12-02 17:09:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 17:09:39,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:39,610 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:39,610 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:39,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1917507850, now seen corresponding path program 1 times [2018-12-02 17:09:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:39,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:39,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:39,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:39,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:39,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:39,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:39,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:39,644 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2018-12-02 17:09:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:39,852 INFO L93 Difference]: Finished difference Result 864 states and 1283 transitions. [2018-12-02 17:09:39,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:39,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 17:09:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:39,853 INFO L225 Difference]: With dead ends: 864 [2018-12-02 17:09:39,853 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 17:09:39,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 17:09:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2018-12-02 17:09:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 632 transitions. [2018-12-02 17:09:39,877 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 632 transitions. Word has length 161 [2018-12-02 17:09:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:39,877 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 632 transitions. [2018-12-02 17:09:39,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 632 transitions. [2018-12-02 17:09:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 17:09:39,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:39,877 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:39,877 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:39,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:39,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1732027237, now seen corresponding path program 1 times [2018-12-02 17:09:39,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:39,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:39,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:39,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:39,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:39,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:39,911 INFO L87 Difference]: Start difference. First operand 428 states and 632 transitions. Second operand 4 states. [2018-12-02 17:09:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:40,111 INFO L93 Difference]: Finished difference Result 864 states and 1281 transitions. [2018-12-02 17:09:40,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:40,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 17:09:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:40,112 INFO L225 Difference]: With dead ends: 864 [2018-12-02 17:09:40,112 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 17:09:40,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 17:09:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2018-12-02 17:09:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2018-12-02 17:09:40,136 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 161 [2018-12-02 17:09:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:40,136 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2018-12-02 17:09:40,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2018-12-02 17:09:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 17:09:40,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:40,137 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:40,137 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:40,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -909058621, now seen corresponding path program 1 times [2018-12-02 17:09:40,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:40,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:40,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:40,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:40,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:40,173 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2018-12-02 17:09:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:40,380 INFO L93 Difference]: Finished difference Result 862 states and 1277 transitions. [2018-12-02 17:09:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:40,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 17:09:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:40,381 INFO L225 Difference]: With dead ends: 862 [2018-12-02 17:09:40,381 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 17:09:40,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 17:09:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2018-12-02 17:09:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 630 transitions. [2018-12-02 17:09:40,405 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 630 transitions. Word has length 162 [2018-12-02 17:09:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:40,405 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 630 transitions. [2018-12-02 17:09:40,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 630 transitions. [2018-12-02 17:09:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 17:09:40,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:40,406 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:40,406 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:40,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 429936214, now seen corresponding path program 1 times [2018-12-02 17:09:40,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:40,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:40,444 INFO L87 Difference]: Start difference. First operand 428 states and 630 transitions. Second operand 4 states. [2018-12-02 17:09:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:40,652 INFO L93 Difference]: Finished difference Result 862 states and 1275 transitions. [2018-12-02 17:09:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:40,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-02 17:09:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:40,653 INFO L225 Difference]: With dead ends: 862 [2018-12-02 17:09:40,653 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 17:09:40,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 17:09:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2018-12-02 17:09:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-02 17:09:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2018-12-02 17:09:40,677 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 163 [2018-12-02 17:09:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:40,677 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2018-12-02 17:09:40,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2018-12-02 17:09:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 17:09:40,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:40,678 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:40,678 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:40,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:40,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1991590309, now seen corresponding path program 1 times [2018-12-02 17:09:40,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:40,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:40,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:40,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:40,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:40,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:40,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:40,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:40,739 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2018-12-02 17:09:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:40,960 INFO L93 Difference]: Finished difference Result 897 states and 1332 transitions. [2018-12-02 17:09:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:40,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-02 17:09:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:40,961 INFO L225 Difference]: With dead ends: 897 [2018-12-02 17:09:40,961 INFO L226 Difference]: Without dead ends: 494 [2018-12-02 17:09:40,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-12-02 17:09:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 458. [2018-12-02 17:09:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-12-02 17:09:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2018-12-02 17:09:40,986 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 163 [2018-12-02 17:09:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:40,986 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2018-12-02 17:09:40,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2018-12-02 17:09:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 17:09:40,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:40,987 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:40,987 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:40,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:40,987 INFO L82 PathProgramCache]: Analyzing trace with hash -594323234, now seen corresponding path program 1 times [2018-12-02 17:09:40,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:40,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:40,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:41,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:41,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:41,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:41,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:41,026 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand 4 states. [2018-12-02 17:09:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:41,230 INFO L93 Difference]: Finished difference Result 920 states and 1377 transitions. [2018-12-02 17:09:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:41,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-02 17:09:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:41,231 INFO L225 Difference]: With dead ends: 920 [2018-12-02 17:09:41,231 INFO L226 Difference]: Without dead ends: 487 [2018-12-02 17:09:41,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-12-02 17:09:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 420. [2018-12-02 17:09:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 17:09:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2018-12-02 17:09:41,256 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 164 [2018-12-02 17:09:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:41,257 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2018-12-02 17:09:41,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2018-12-02 17:09:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 17:09:41,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:41,257 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:09:41,257 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:41,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -357382928, now seen corresponding path program 1 times [2018-12-02 17:09:41,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 17:09:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:41,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:41,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:41,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:41,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:41,296 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2018-12-02 17:09:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:41,494 INFO L93 Difference]: Finished difference Result 882 states and 1320 transitions. [2018-12-02 17:09:41,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:41,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 17:09:41,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:41,495 INFO L225 Difference]: With dead ends: 882 [2018-12-02 17:09:41,495 INFO L226 Difference]: Without dead ends: 487 [2018-12-02 17:09:41,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-12-02 17:09:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 450. [2018-12-02 17:09:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:09:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 671 transitions. [2018-12-02 17:09:41,521 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 671 transitions. Word has length 166 [2018-12-02 17:09:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:41,521 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 671 transitions. [2018-12-02 17:09:41,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 671 transitions. [2018-12-02 17:09:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 17:09:41,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:41,521 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:41,522 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:41,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash -920966107, now seen corresponding path program 1 times [2018-12-02 17:09:41,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 17:09:41,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:41,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:41,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:41,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:41,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:41,555 INFO L87 Difference]: Start difference. First operand 450 states and 671 transitions. Second operand 4 states. [2018-12-02 17:09:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:41,787 INFO L93 Difference]: Finished difference Result 914 states and 1366 transitions. [2018-12-02 17:09:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:41,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 17:09:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:41,788 INFO L225 Difference]: With dead ends: 914 [2018-12-02 17:09:41,788 INFO L226 Difference]: Without dead ends: 489 [2018-12-02 17:09:41,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-12-02 17:09:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2018-12-02 17:09:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:09:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2018-12-02 17:09:41,815 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 166 [2018-12-02 17:09:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:41,815 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2018-12-02 17:09:41,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2018-12-02 17:09:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 17:09:41,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:41,816 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:41,816 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 526427412, now seen corresponding path program 1 times [2018-12-02 17:09:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:41,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:41,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:41,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 17:09:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:41,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:41,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:41,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:41,854 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand 4 states. [2018-12-02 17:09:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:42,040 INFO L93 Difference]: Finished difference Result 888 states and 1330 transitions. [2018-12-02 17:09:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:42,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 17:09:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:42,041 INFO L225 Difference]: With dead ends: 888 [2018-12-02 17:09:42,041 INFO L226 Difference]: Without dead ends: 463 [2018-12-02 17:09:42,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-02 17:09:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2018-12-02 17:09:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:09:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2018-12-02 17:09:42,067 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 167 [2018-12-02 17:09:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:42,067 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2018-12-02 17:09:42,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2018-12-02 17:09:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 17:09:42,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:42,067 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:42,067 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:42,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash 507298066, now seen corresponding path program 1 times [2018-12-02 17:09:42,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:42,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 17:09:42,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:42,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:42,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:42,100 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand 4 states. [2018-12-02 17:09:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:42,355 INFO L93 Difference]: Finished difference Result 914 states and 1362 transitions. [2018-12-02 17:09:42,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:42,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 17:09:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:42,356 INFO L225 Difference]: With dead ends: 914 [2018-12-02 17:09:42,356 INFO L226 Difference]: Without dead ends: 489 [2018-12-02 17:09:42,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-12-02 17:09:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2018-12-02 17:09:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:09:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 668 transitions. [2018-12-02 17:09:42,382 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 668 transitions. Word has length 167 [2018-12-02 17:09:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:42,383 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 668 transitions. [2018-12-02 17:09:42,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 668 transitions. [2018-12-02 17:09:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 17:09:42,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:42,383 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:42,383 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:42,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1908215008, now seen corresponding path program 1 times [2018-12-02 17:09:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:42,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 17:09:42,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:42,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:42,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:42,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:42,419 INFO L87 Difference]: Start difference. First operand 450 states and 668 transitions. Second operand 4 states. [2018-12-02 17:09:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:42,618 INFO L93 Difference]: Finished difference Result 899 states and 1342 transitions. [2018-12-02 17:09:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:42,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-02 17:09:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:42,619 INFO L225 Difference]: With dead ends: 899 [2018-12-02 17:09:42,619 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 17:09:42,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 17:09:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 450. [2018-12-02 17:09:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:09:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 667 transitions. [2018-12-02 17:09:42,646 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 667 transitions. Word has length 168 [2018-12-02 17:09:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:42,646 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 667 transitions. [2018-12-02 17:09:42,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 667 transitions. [2018-12-02 17:09:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 17:09:42,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:42,647 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:42,647 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:42,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -640224110, now seen corresponding path program 1 times [2018-12-02 17:09:42,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:42,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:42,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:42,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:09:42,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:42,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:09:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:09:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:42,718 INFO L87 Difference]: Start difference. First operand 450 states and 667 transitions. Second operand 5 states. [2018-12-02 17:09:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:43,053 INFO L93 Difference]: Finished difference Result 951 states and 1423 transitions. [2018-12-02 17:09:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:09:43,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2018-12-02 17:09:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:43,054 INFO L225 Difference]: With dead ends: 951 [2018-12-02 17:09:43,054 INFO L226 Difference]: Without dead ends: 526 [2018-12-02 17:09:43,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:09:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-12-02 17:09:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 483. [2018-12-02 17:09:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-02 17:09:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 726 transitions. [2018-12-02 17:09:43,084 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 726 transitions. Word has length 168 [2018-12-02 17:09:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:43,084 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 726 transitions. [2018-12-02 17:09:43,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:09:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 726 transitions. [2018-12-02 17:09:43,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-02 17:09:43,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:43,085 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:43,085 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:43,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:43,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1558397127, now seen corresponding path program 1 times [2018-12-02 17:09:43,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:43,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:43,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 17:09:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:43,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:43,132 INFO L87 Difference]: Start difference. First operand 483 states and 726 transitions. Second operand 4 states. [2018-12-02 17:09:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:43,345 INFO L93 Difference]: Finished difference Result 963 states and 1456 transitions. [2018-12-02 17:09:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:43,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-02 17:09:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:43,346 INFO L225 Difference]: With dead ends: 963 [2018-12-02 17:09:43,346 INFO L226 Difference]: Without dead ends: 505 [2018-12-02 17:09:43,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-02 17:09:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2018-12-02 17:09:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-12-02 17:09:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 725 transitions. [2018-12-02 17:09:43,374 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 725 transitions. Word has length 169 [2018-12-02 17:09:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:43,374 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 725 transitions. [2018-12-02 17:09:43,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 725 transitions. [2018-12-02 17:09:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 17:09:43,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:43,375 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:43,375 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:43,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:43,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1834673457, now seen corresponding path program 1 times [2018-12-02 17:09:43,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-02 17:09:43,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:43,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:09:43,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:43,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:09:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:09:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:43,407 INFO L87 Difference]: Start difference. First operand 483 states and 725 transitions. Second operand 3 states. [2018-12-02 17:09:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:43,496 INFO L93 Difference]: Finished difference Result 1391 states and 2109 transitions. [2018-12-02 17:09:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:09:43,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-02 17:09:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:43,497 INFO L225 Difference]: With dead ends: 1391 [2018-12-02 17:09:43,497 INFO L226 Difference]: Without dead ends: 933 [2018-12-02 17:09:43,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-02 17:09:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2018-12-02 17:09:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-12-02 17:09:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1401 transitions. [2018-12-02 17:09:43,564 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1401 transitions. Word has length 172 [2018-12-02 17:09:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:43,564 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1401 transitions. [2018-12-02 17:09:43,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:09:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1401 transitions. [2018-12-02 17:09:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 17:09:43,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:43,565 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:43,565 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:43,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash -784173615, now seen corresponding path program 1 times [2018-12-02 17:09:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:43,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:43,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:09:43,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:43,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:09:43,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:09:43,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:43,604 INFO L87 Difference]: Start difference. First operand 933 states and 1401 transitions. Second operand 3 states. [2018-12-02 17:09:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:43,732 INFO L93 Difference]: Finished difference Result 2289 states and 3456 transitions. [2018-12-02 17:09:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:09:43,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-02 17:09:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:43,733 INFO L225 Difference]: With dead ends: 2289 [2018-12-02 17:09:43,733 INFO L226 Difference]: Without dead ends: 1381 [2018-12-02 17:09:43,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2018-12-02 17:09:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1379. [2018-12-02 17:09:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2018-12-02 17:09:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2072 transitions. [2018-12-02 17:09:43,819 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2072 transitions. Word has length 173 [2018-12-02 17:09:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:43,819 INFO L480 AbstractCegarLoop]: Abstraction has 1379 states and 2072 transitions. [2018-12-02 17:09:43,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:09:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2072 transitions. [2018-12-02 17:09:43,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 17:09:43,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:43,820 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:43,820 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:43,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:43,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1650342192, now seen corresponding path program 1 times [2018-12-02 17:09:43,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:43,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 17:09:43,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:43,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:43,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:43,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:43,861 INFO L87 Difference]: Start difference. First operand 1379 states and 2072 transitions. Second operand 4 states. [2018-12-02 17:09:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:44,158 INFO L93 Difference]: Finished difference Result 2840 states and 4250 transitions. [2018-12-02 17:09:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:44,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 17:09:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:44,159 INFO L225 Difference]: With dead ends: 2840 [2018-12-02 17:09:44,159 INFO L226 Difference]: Without dead ends: 1486 [2018-12-02 17:09:44,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-12-02 17:09:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1289. [2018-12-02 17:09:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-12-02 17:09:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1934 transitions. [2018-12-02 17:09:44,240 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1934 transitions. Word has length 173 [2018-12-02 17:09:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:44,240 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 1934 transitions. [2018-12-02 17:09:44,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1934 transitions. [2018-12-02 17:09:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 17:09:44,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:44,241 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:44,241 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:44,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -534959922, now seen corresponding path program 1 times [2018-12-02 17:09:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 17:09:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:09:44,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:44,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:09:44,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:09:44,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:44,271 INFO L87 Difference]: Start difference. First operand 1289 states and 1934 transitions. Second operand 3 states. [2018-12-02 17:09:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:44,394 INFO L93 Difference]: Finished difference Result 2972 states and 4478 transitions. [2018-12-02 17:09:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:09:44,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-02 17:09:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:44,395 INFO L225 Difference]: With dead ends: 2972 [2018-12-02 17:09:44,395 INFO L226 Difference]: Without dead ends: 1708 [2018-12-02 17:09:44,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2018-12-02 17:09:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1702. [2018-12-02 17:09:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-12-02 17:09:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2557 transitions. [2018-12-02 17:09:44,504 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2557 transitions. Word has length 174 [2018-12-02 17:09:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:44,504 INFO L480 AbstractCegarLoop]: Abstraction has 1702 states and 2557 transitions. [2018-12-02 17:09:44,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:09:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2557 transitions. [2018-12-02 17:09:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 17:09:44,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:44,505 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:44,505 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:44,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash 438987165, now seen corresponding path program 1 times [2018-12-02 17:09:44,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 17:09:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:44,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:44,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:44,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:44,541 INFO L87 Difference]: Start difference. First operand 1702 states and 2557 transitions. Second operand 4 states. [2018-12-02 17:09:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:44,840 INFO L93 Difference]: Finished difference Result 3572 states and 5352 transitions. [2018-12-02 17:09:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:44,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-02 17:09:44,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:44,842 INFO L225 Difference]: With dead ends: 3572 [2018-12-02 17:09:44,842 INFO L226 Difference]: Without dead ends: 1895 [2018-12-02 17:09:44,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2018-12-02 17:09:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1795. [2018-12-02 17:09:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-12-02 17:09:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2695 transitions. [2018-12-02 17:09:44,952 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2695 transitions. Word has length 174 [2018-12-02 17:09:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:44,952 INFO L480 AbstractCegarLoop]: Abstraction has 1795 states and 2695 transitions. [2018-12-02 17:09:44,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2695 transitions. [2018-12-02 17:09:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 17:09:44,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:44,953 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:44,953 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:44,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1483011888, now seen corresponding path program 1 times [2018-12-02 17:09:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:44,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 17:09:44,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:44,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:09:44,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:09:44,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:09:44,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:44,978 INFO L87 Difference]: Start difference. First operand 1795 states and 2695 transitions. Second operand 3 states. [2018-12-02 17:09:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:45,114 INFO L93 Difference]: Finished difference Result 3592 states and 5399 transitions. [2018-12-02 17:09:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:09:45,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-02 17:09:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:45,115 INFO L225 Difference]: With dead ends: 3592 [2018-12-02 17:09:45,115 INFO L226 Difference]: Without dead ends: 1822 [2018-12-02 17:09:45,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2018-12-02 17:09:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2018-12-02 17:09:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2018-12-02 17:09:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2730 transitions. [2018-12-02 17:09:45,231 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2730 transitions. Word has length 174 [2018-12-02 17:09:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:45,231 INFO L480 AbstractCegarLoop]: Abstraction has 1822 states and 2730 transitions. [2018-12-02 17:09:45,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:09:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2730 transitions. [2018-12-02 17:09:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 17:09:45,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:45,233 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:45,233 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1097149486, now seen corresponding path program 1 times [2018-12-02 17:09:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:45,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:45,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 17:09:45,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:45,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:09:45,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:45,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:09:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:09:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:45,255 INFO L87 Difference]: Start difference. First operand 1822 states and 2730 transitions. Second operand 3 states. [2018-12-02 17:09:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:45,380 INFO L93 Difference]: Finished difference Result 3621 states and 5435 transitions. [2018-12-02 17:09:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:09:45,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-02 17:09:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:45,382 INFO L225 Difference]: With dead ends: 3621 [2018-12-02 17:09:45,382 INFO L226 Difference]: Without dead ends: 1824 [2018-12-02 17:09:45,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:09:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2018-12-02 17:09:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2018-12-02 17:09:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-12-02 17:09:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2732 transitions. [2018-12-02 17:09:45,501 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2732 transitions. Word has length 174 [2018-12-02 17:09:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:45,501 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2732 transitions. [2018-12-02 17:09:45,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:09:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2732 transitions. [2018-12-02 17:09:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 17:09:45,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:45,502 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:45,502 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:45,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 845810786, now seen corresponding path program 1 times [2018-12-02 17:09:45,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:45,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:45,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:45,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:45,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:45,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:45,550 INFO L87 Difference]: Start difference. First operand 1824 states and 2732 transitions. Second operand 4 states. [2018-12-02 17:09:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:45,963 INFO L93 Difference]: Finished difference Result 3766 states and 5621 transitions. [2018-12-02 17:09:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:45,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-02 17:09:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:45,966 INFO L225 Difference]: With dead ends: 3766 [2018-12-02 17:09:45,966 INFO L226 Difference]: Without dead ends: 1969 [2018-12-02 17:09:45,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-02 17:09:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-12-02 17:09:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-12-02 17:09:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2728 transitions. [2018-12-02 17:09:46,085 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2728 transitions. Word has length 178 [2018-12-02 17:09:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:46,085 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2728 transitions. [2018-12-02 17:09:46,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2728 transitions. [2018-12-02 17:09:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 17:09:46,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:46,086 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:46,086 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:46,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -557193099, now seen corresponding path program 1 times [2018-12-02 17:09:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:46,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:46,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:46,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:46,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:46,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:46,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:46,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:46,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:46,127 INFO L87 Difference]: Start difference. First operand 1824 states and 2728 transitions. Second operand 4 states. [2018-12-02 17:09:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:46,504 INFO L93 Difference]: Finished difference Result 3766 states and 5613 transitions. [2018-12-02 17:09:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:46,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-02 17:09:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:46,506 INFO L225 Difference]: With dead ends: 3766 [2018-12-02 17:09:46,506 INFO L226 Difference]: Without dead ends: 1969 [2018-12-02 17:09:46,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-02 17:09:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-12-02 17:09:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-12-02 17:09:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2724 transitions. [2018-12-02 17:09:46,626 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2724 transitions. Word has length 179 [2018-12-02 17:09:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:46,626 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2724 transitions. [2018-12-02 17:09:46,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2724 transitions. [2018-12-02 17:09:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 17:09:46,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:46,627 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:46,627 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:46,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:46,627 INFO L82 PathProgramCache]: Analyzing trace with hash -547702755, now seen corresponding path program 1 times [2018-12-02 17:09:46,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:46,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:46,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:46,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:46,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:46,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:46,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:46,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:46,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:46,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:46,667 INFO L87 Difference]: Start difference. First operand 1824 states and 2724 transitions. Second operand 4 states. [2018-12-02 17:09:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:47,068 INFO L93 Difference]: Finished difference Result 3766 states and 5605 transitions. [2018-12-02 17:09:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:47,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-02 17:09:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:47,071 INFO L225 Difference]: With dead ends: 3766 [2018-12-02 17:09:47,071 INFO L226 Difference]: Without dead ends: 1969 [2018-12-02 17:09:47,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-02 17:09:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2018-12-02 17:09:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-12-02 17:09:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2720 transitions. [2018-12-02 17:09:47,191 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2720 transitions. Word has length 180 [2018-12-02 17:09:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:47,192 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2720 transitions. [2018-12-02 17:09:47,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2720 transitions. [2018-12-02 17:09:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-02 17:09:47,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:47,193 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:47,193 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:47,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:47,193 INFO L82 PathProgramCache]: Analyzing trace with hash 299435728, now seen corresponding path program 1 times [2018-12-02 17:09:47,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:47,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:47,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:47,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:47,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:47,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:09:47,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:09:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:09:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:09:47,230 INFO L87 Difference]: Start difference. First operand 1824 states and 2720 transitions. Second operand 4 states. [2018-12-02 17:09:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:47,595 INFO L93 Difference]: Finished difference Result 3726 states and 5549 transitions. [2018-12-02 17:09:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:47,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-12-02 17:09:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:47,597 INFO L225 Difference]: With dead ends: 3726 [2018-12-02 17:09:47,597 INFO L226 Difference]: Without dead ends: 1929 [2018-12-02 17:09:47,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2018-12-02 17:09:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1824. [2018-12-02 17:09:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2018-12-02 17:09:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2716 transitions. [2018-12-02 17:09:47,719 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2716 transitions. Word has length 181 [2018-12-02 17:09:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:47,719 INFO L480 AbstractCegarLoop]: Abstraction has 1824 states and 2716 transitions. [2018-12-02 17:09:47,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:09:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2716 transitions. [2018-12-02 17:09:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 17:09:47,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:47,720 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:47,720 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:47,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1232634325, now seen corresponding path program 1 times [2018-12-02 17:09:47,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:47,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:47,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:09:47,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:47,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:09:47,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:47,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:09:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:09:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:47,789 INFO L87 Difference]: Start difference. First operand 1824 states and 2716 transitions. Second operand 5 states. [2018-12-02 17:09:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:48,305 INFO L93 Difference]: Finished difference Result 4075 states and 6089 transitions. [2018-12-02 17:09:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:48,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-12-02 17:09:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:48,307 INFO L225 Difference]: With dead ends: 4075 [2018-12-02 17:09:48,308 INFO L226 Difference]: Without dead ends: 2278 [2018-12-02 17:09:48,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:09:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2018-12-02 17:09:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1983. [2018-12-02 17:09:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2018-12-02 17:09:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3003 transitions. [2018-12-02 17:09:48,433 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3003 transitions. Word has length 183 [2018-12-02 17:09:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:48,433 INFO L480 AbstractCegarLoop]: Abstraction has 1983 states and 3003 transitions. [2018-12-02 17:09:48,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:09:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3003 transitions. [2018-12-02 17:09:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-02 17:09:48,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:48,434 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:48,434 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:48,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1900962557, now seen corresponding path program 1 times [2018-12-02 17:09:48,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:48,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:09:48,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:09:48,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:09:48,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:48,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:09:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:09:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:09:48,503 INFO L87 Difference]: Start difference. First operand 1983 states and 3003 transitions. Second operand 5 states. [2018-12-02 17:09:48,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:48,983 INFO L93 Difference]: Finished difference Result 4346 states and 6596 transitions. [2018-12-02 17:09:48,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:09:48,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-12-02 17:09:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:48,985 INFO L225 Difference]: With dead ends: 4346 [2018-12-02 17:09:48,985 INFO L226 Difference]: Without dead ends: 2390 [2018-12-02 17:09:48,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:09:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2018-12-02 17:09:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2091. [2018-12-02 17:09:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-12-02 17:09:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3223 transitions. [2018-12-02 17:09:49,113 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3223 transitions. Word has length 184 [2018-12-02 17:09:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:49,113 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 3223 transitions. [2018-12-02 17:09:49,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:09:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3223 transitions. [2018-12-02 17:09:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-02 17:09:49,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:49,114 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:49,114 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:49,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash -48790797, now seen corresponding path program 1 times [2018-12-02 17:09:49,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:49,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 21 proven. 303 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 17:09:49,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:09:49,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:09:49,455 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-02 17:09:49,456 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [337], [342], [377], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:09:49,480 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:09:49,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:09:49,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:09:49,946 INFO L272 AbstractInterpreter]: Visited 85 different actions 289 times. Merged at 70 different actions 188 times. Never widened. Performed 2191 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 12 different actions. Largest state had 137 variables. [2018-12-02 17:09:49,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:49,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:09:49,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:09:49,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:09:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:49,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:09:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:50,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:09:50,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,138 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-02 17:09:50,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 17:09:50,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 17:09:50,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-02 17:09:50,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-02 17:09:50,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 17:09:50,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 17:09:50,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,232 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,240 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,249 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 17:09:50,284 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 17:09:50,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 17:09:50,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 17:09:50,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 17:09:50,367 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,410 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 17:09:50,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:50,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:50,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:09:50,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:50,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:50,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:50,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:50,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:09:50,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:09:50,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:50,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:09:50,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,686 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:09:50,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2018-12-02 17:09:50,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:09:50,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 153 [2018-12-02 17:09:50,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:09:50,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-02 17:09:50,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:09:50,744 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,745 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,753 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:208, output treesize:100 [2018-12-02 17:09:50,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-12-02 17:09:50,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-02 17:09:50,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-02 17:09:50,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:09:50,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:82 [2018-12-02 17:09:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-02 17:09:50,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:09:50,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:50,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2018-12-02 17:09:50,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:50,998 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:51,017 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:51,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 104 [2018-12-02 17:09:51,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:51,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2018-12-02 17:09:51,022 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 17:09:51,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-12-02 17:09:51,031 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,034 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,038 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:51,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 121 [2018-12-02 17:09:51,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:51,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-12-02 17:09:51,049 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:51,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 17:09:51,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-12-02 17:09:51,057 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,060 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,064 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 24 [2018-12-02 17:09:51,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-02 17:09:51,075 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,079 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 46 [2018-12-02 17:09:51,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-02 17:09:51,082 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,084 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:51,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 17:09:51,090 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2018-12-02 17:09:51,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 17:09:51,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:09:51,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:09:51,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 17:09:51,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:09:51,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:09:51,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,209 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:51,212 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:25 [2018-12-02 17:09:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-02 17:09:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:09:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [12] total 21 [2018-12-02 17:09:51,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:09:51,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:09:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:09:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-02 17:09:51,308 INFO L87 Difference]: Start difference. First operand 2091 states and 3223 transitions. Second operand 7 states. [2018-12-02 17:09:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:09:52,447 INFO L93 Difference]: Finished difference Result 6195 states and 9561 transitions. [2018-12-02 17:09:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:09:52,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-12-02 17:09:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:09:52,453 INFO L225 Difference]: With dead ends: 6195 [2018-12-02 17:09:52,453 INFO L226 Difference]: Without dead ends: 4131 [2018-12-02 17:09:52,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 382 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-02 17:09:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2018-12-02 17:09:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 2099. [2018-12-02 17:09:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2099 states. [2018-12-02 17:09:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 3231 transitions. [2018-12-02 17:09:52,608 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 3231 transitions. Word has length 197 [2018-12-02 17:09:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:09:52,608 INFO L480 AbstractCegarLoop]: Abstraction has 2099 states and 3231 transitions. [2018-12-02 17:09:52,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:09:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 3231 transitions. [2018-12-02 17:09:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-02 17:09:52,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:09:52,610 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:09:52,611 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:09:52,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1324200915, now seen corresponding path program 1 times [2018-12-02 17:09:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:09:52,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:52,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:52,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:09:52,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:09:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 17:09:53,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:09:53,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:09:53,011 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-02 17:09:53,011 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:09:53,013 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:09:53,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:09:53,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:09:53,222 INFO L272 AbstractInterpreter]: Visited 85 different actions 228 times. Merged at 68 different actions 133 times. Never widened. Performed 1659 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1659 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 138 variables. [2018-12-02 17:09:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:09:53,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:09:53,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:09:53,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:09:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:09:53,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:09:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:09:53,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:09:53,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,327 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-02 17:09:53,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 17:09:53,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 17:09:53,377 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-02 17:09:53,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-02 17:09:53,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 17:09:53,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 17:09:53,408 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,415 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,418 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,429 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 17:09:53,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 17:09:53,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 17:09:53,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 17:09:53,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 17:09:53,546 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,574 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,587 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 17:09:53,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:53,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:53,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:53,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:53,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:53,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:09:53,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:09:53,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:09:53,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,718 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,732 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:09:53,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:53,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:53,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:53,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:09:53,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:09:53,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:09:53,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:09:53,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:09:53,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:09:53,839 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,869 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:09:53,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 17:09:53,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 17:09:53,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 17:09:53,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-02 17:09:53,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 17:09:53,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:09:53,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:09:53,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:53,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:09:53,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,969 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:09:53,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 17:09:53,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 17:09:53,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:53,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 17:09:53,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-02 17:09:53,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:53,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 17:09:54,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-02 17:09:54,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:09:54,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-02 17:09:54,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:09:54,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-02 17:09:54,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,086 INFO L478 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 18 treesize of output 37 [2018-12-02 17:09:54,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 121 [2018-12-02 17:09:54,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:09:54,205 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,272 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,363 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,369 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 182 [2018-12-02 17:09:54,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 232 [2018-12-02 17:09:54,527 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-02 17:09:54,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:09:54,603 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 125 [2018-12-02 17:09:54,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 210 [2018-12-02 17:09:54,669 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,694 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,706 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,718 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-02 17:09:54,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 17:09:54,742 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,747 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,761 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 17:09:54,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-12-02 17:09:54,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-02 17:09:54,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 17:09:54,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:54,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-12-02 17:09:54,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:54,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-12-02 17:09:54,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-12-02 17:09:54,840 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,846 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:54,851 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 17:09:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:55,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:09:55,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:55,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 218 [2018-12-02 17:09:55,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:09:55,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 191 [2018-12-02 17:09:55,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,208 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,229 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,254 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,268 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 196 [2018-12-02 17:09:55,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 187 [2018-12-02 17:09:55,285 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,288 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 159 [2018-12-02 17:09:55,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 17:09:55,300 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 129 [2018-12-02 17:09:55,326 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,327 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,327 INFO L478 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 31 treesize of output 70 [2018-12-02 17:09:55,327 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 168 [2018-12-02 17:09:55,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-02 17:09:55,344 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,352 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,352 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,353 INFO L478 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 17 treesize of output 7 [2018-12-02 17:09:55,353 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,356 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 112 [2018-12-02 17:09:55,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,367 INFO L478 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 107 treesize of output 98 [2018-12-02 17:09:55,367 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-02 17:09:55,378 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,388 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,388 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:09:55,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-02 17:09:55,390 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:09:55,398 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:09:55,406 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:09:55,428 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:09:55,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 17:09:55,437 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:109 [2018-12-02 17:09:55,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 17:09:55,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 17:09:55,474 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 17:09:55,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,520 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-02 17:09:55,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 17:09:55,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 17:09:55,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 17:09:55,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 17:09:55,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 17:09:55,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 17:09:55,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,657 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 17:09:55,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 17:09:55,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 17:09:55,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,737 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 17:09:55,748 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:25 [2018-12-02 17:09:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:09:55,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:09:55,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 25 [2018-12-02 17:09:55,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:09:55,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 17:09:55,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 17:09:55,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-12-02 17:09:55,866 INFO L87 Difference]: Start difference. First operand 2099 states and 3231 transitions. Second operand 18 states. [2018-12-02 17:10:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:01,299 INFO L93 Difference]: Finished difference Result 7070 states and 10741 transitions. [2018-12-02 17:10:01,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:10:01,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 197 [2018-12-02 17:10:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:01,304 INFO L225 Difference]: With dead ends: 7070 [2018-12-02 17:10:01,304 INFO L226 Difference]: Without dead ends: 4998 [2018-12-02 17:10:01,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 373 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 17:10:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2018-12-02 17:10:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 2867. [2018-12-02 17:10:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2018-12-02 17:10:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4535 transitions. [2018-12-02 17:10:01,500 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4535 transitions. Word has length 197 [2018-12-02 17:10:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:01,500 INFO L480 AbstractCegarLoop]: Abstraction has 2867 states and 4535 transitions. [2018-12-02 17:10:01,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 17:10:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4535 transitions. [2018-12-02 17:10:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-02 17:10:01,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:01,502 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:10:01,502 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:01,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash 380414431, now seen corresponding path program 1 times [2018-12-02 17:10:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:01,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-02 17:10:01,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:01,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:01,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:01,562 INFO L87 Difference]: Start difference. First operand 2867 states and 4535 transitions. Second operand 4 states. [2018-12-02 17:10:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:01,967 INFO L93 Difference]: Finished difference Result 5792 states and 9159 transitions. [2018-12-02 17:10:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:01,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-12-02 17:10:01,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:01,970 INFO L225 Difference]: With dead ends: 5792 [2018-12-02 17:10:01,970 INFO L226 Difference]: Without dead ends: 2952 [2018-12-02 17:10:01,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2018-12-02 17:10:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 2867. [2018-12-02 17:10:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2018-12-02 17:10:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4531 transitions. [2018-12-02 17:10:02,164 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4531 transitions. Word has length 198 [2018-12-02 17:10:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:02,164 INFO L480 AbstractCegarLoop]: Abstraction has 2867 states and 4531 transitions. [2018-12-02 17:10:02,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4531 transitions. [2018-12-02 17:10:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-02 17:10:02,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:02,166 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:10:02,166 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:02,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:02,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1348782368, now seen corresponding path program 1 times [2018-12-02 17:10:02,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:02,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:02,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:02,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:02,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 17:10:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:02,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:02,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:02,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:02,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:02,222 INFO L87 Difference]: Start difference. First operand 2867 states and 4531 transitions. Second operand 4 states. [2018-12-02 17:10:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:02,729 INFO L93 Difference]: Finished difference Result 5812 states and 9171 transitions. [2018-12-02 17:10:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:02,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-12-02 17:10:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:02,734 INFO L225 Difference]: With dead ends: 5812 [2018-12-02 17:10:02,734 INFO L226 Difference]: Without dead ends: 2972 [2018-12-02 17:10:02,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-12-02 17:10:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2867. [2018-12-02 17:10:02,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2018-12-02 17:10:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4527 transitions. [2018-12-02 17:10:02,932 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4527 transitions. Word has length 205 [2018-12-02 17:10:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:02,932 INFO L480 AbstractCegarLoop]: Abstraction has 2867 states and 4527 transitions. [2018-12-02 17:10:02,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4527 transitions. [2018-12-02 17:10:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-02 17:10:02,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:02,933 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:10:02,933 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:02,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1548831341, now seen corresponding path program 1 times [2018-12-02 17:10:02,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:02,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:02,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:02,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:02,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 17:10:02,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:02,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:02,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:02,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:02,983 INFO L87 Difference]: Start difference. First operand 2867 states and 4527 transitions. Second operand 4 states. [2018-12-02 17:10:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:03,415 INFO L93 Difference]: Finished difference Result 5804 states and 9155 transitions. [2018-12-02 17:10:03,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:03,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-02 17:10:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:03,418 INFO L225 Difference]: With dead ends: 5804 [2018-12-02 17:10:03,418 INFO L226 Difference]: Without dead ends: 2964 [2018-12-02 17:10:03,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2018-12-02 17:10:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2867. [2018-12-02 17:10:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2018-12-02 17:10:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4523 transitions. [2018-12-02 17:10:03,605 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4523 transitions. Word has length 206 [2018-12-02 17:10:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:03,605 INFO L480 AbstractCegarLoop]: Abstraction has 2867 states and 4523 transitions. [2018-12-02 17:10:03,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4523 transitions. [2018-12-02 17:10:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 17:10:03,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:03,606 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:03,606 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:03,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:03,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1152197683, now seen corresponding path program 1 times [2018-12-02 17:10:03,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:03,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-02 17:10:03,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:03,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:10:03,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:03,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:10:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:10:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:03,692 INFO L87 Difference]: Start difference. First operand 2867 states and 4523 transitions. Second operand 6 states. [2018-12-02 17:10:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:04,587 INFO L93 Difference]: Finished difference Result 6432 states and 10051 transitions. [2018-12-02 17:10:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:10:04,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-12-02 17:10:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:04,590 INFO L225 Difference]: With dead ends: 6432 [2018-12-02 17:10:04,590 INFO L226 Difference]: Without dead ends: 3592 [2018-12-02 17:10:04,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:10:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2018-12-02 17:10:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2495. [2018-12-02 17:10:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2018-12-02 17:10:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3891 transitions. [2018-12-02 17:10:04,766 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3891 transitions. Word has length 210 [2018-12-02 17:10:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:04,766 INFO L480 AbstractCegarLoop]: Abstraction has 2495 states and 3891 transitions. [2018-12-02 17:10:04,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:10:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3891 transitions. [2018-12-02 17:10:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-02 17:10:04,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:04,767 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:04,768 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:04,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -946978016, now seen corresponding path program 1 times [2018-12-02 17:10:04,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:04,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-02 17:10:04,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:04,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:10:04,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:04,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:10:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:10:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:04,864 INFO L87 Difference]: Start difference. First operand 2495 states and 3891 transitions. Second operand 6 states. [2018-12-02 17:10:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:05,751 INFO L93 Difference]: Finished difference Result 5540 states and 8579 transitions. [2018-12-02 17:10:05,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:10:05,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-12-02 17:10:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:05,754 INFO L225 Difference]: With dead ends: 5540 [2018-12-02 17:10:05,754 INFO L226 Difference]: Without dead ends: 3072 [2018-12-02 17:10:05,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:10:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-12-02 17:10:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2499. [2018-12-02 17:10:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2018-12-02 17:10:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3887 transitions. [2018-12-02 17:10:05,921 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3887 transitions. Word has length 211 [2018-12-02 17:10:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:05,921 INFO L480 AbstractCegarLoop]: Abstraction has 2499 states and 3887 transitions. [2018-12-02 17:10:05,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:10:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3887 transitions. [2018-12-02 17:10:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 17:10:05,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:05,923 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:05,923 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:05,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -764304234, now seen corresponding path program 1 times [2018-12-02 17:10:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:05,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:05,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:10:06,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:06,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:06,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:06,018 INFO L87 Difference]: Start difference. First operand 2499 states and 3887 transitions. Second operand 5 states. [2018-12-02 17:10:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:06,574 INFO L93 Difference]: Finished difference Result 5506 states and 8564 transitions. [2018-12-02 17:10:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:06,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-12-02 17:10:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:06,576 INFO L225 Difference]: With dead ends: 5506 [2018-12-02 17:10:06,576 INFO L226 Difference]: Without dead ends: 3034 [2018-12-02 17:10:06,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2018-12-02 17:10:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2647. [2018-12-02 17:10:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-12-02 17:10:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4147 transitions. [2018-12-02 17:10:06,744 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4147 transitions. Word has length 217 [2018-12-02 17:10:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:06,745 INFO L480 AbstractCegarLoop]: Abstraction has 2647 states and 4147 transitions. [2018-12-02 17:10:06,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4147 transitions. [2018-12-02 17:10:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-02 17:10:06,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:06,746 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:06,747 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:06,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1038928542, now seen corresponding path program 1 times [2018-12-02 17:10:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:06,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:10:06,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:06,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:06,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:06,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:06,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:06,821 INFO L87 Difference]: Start difference. First operand 2647 states and 4147 transitions. Second operand 5 states. [2018-12-02 17:10:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:07,383 INFO L93 Difference]: Finished difference Result 5642 states and 8800 transitions. [2018-12-02 17:10:07,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:07,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2018-12-02 17:10:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:07,386 INFO L225 Difference]: With dead ends: 5642 [2018-12-02 17:10:07,386 INFO L226 Difference]: Without dead ends: 3022 [2018-12-02 17:10:07,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2018-12-02 17:10:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2639. [2018-12-02 17:10:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-12-02 17:10:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4131 transitions. [2018-12-02 17:10:07,554 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4131 transitions. Word has length 218 [2018-12-02 17:10:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:07,555 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 4131 transitions. [2018-12-02 17:10:07,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4131 transitions. [2018-12-02 17:10:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-02 17:10:07,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:07,556 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:10:07,556 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:07,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash -525285604, now seen corresponding path program 1 times [2018-12-02 17:10:07,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:07,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:07,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-02 17:10:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:07,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:07,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:07,613 INFO L87 Difference]: Start difference. First operand 2639 states and 4131 transitions. Second operand 4 states. [2018-12-02 17:10:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:08,037 INFO L93 Difference]: Finished difference Result 5344 states and 8359 transitions. [2018-12-02 17:10:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:08,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-12-02 17:10:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:08,040 INFO L225 Difference]: With dead ends: 5344 [2018-12-02 17:10:08,040 INFO L226 Difference]: Without dead ends: 2732 [2018-12-02 17:10:08,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-12-02 17:10:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2639. [2018-12-02 17:10:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-12-02 17:10:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4127 transitions. [2018-12-02 17:10:08,209 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4127 transitions. Word has length 223 [2018-12-02 17:10:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:08,209 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 4127 transitions. [2018-12-02 17:10:08,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4127 transitions. [2018-12-02 17:10:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 17:10:08,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:08,211 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:08,211 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:08,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash -6157552, now seen corresponding path program 1 times [2018-12-02 17:10:08,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:08,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:08,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-02 17:10:08,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:08,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:10:08,296 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-12-02 17:10:08,296 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:10:08,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:10:08,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:10:08,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:10:08,579 INFO L272 AbstractInterpreter]: Visited 97 different actions 328 times. Merged at 78 different actions 209 times. Never widened. Performed 2587 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 17:10:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:08,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:10:08,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:08,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:10:08,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:08,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:10:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:08,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:08,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 17:10:08,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 17:10:08,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 17:10:08,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-12-02 17:10:08,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2018-12-02 17:10:08,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:08,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:08,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-12-02 17:10:08,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-12-02 17:10:08,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 17:10:08,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2018-12-02 17:10:08,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:08,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:08,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 71 [2018-12-02 17:10:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-12-02 17:10:08,780 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-12-02 17:10:08,812 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-12-02 17:10:08,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 47 [2018-12-02 17:10:08,850 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,854 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 91 [2018-12-02 17:10:08,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 49 [2018-12-02 17:10:08,890 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 62 [2018-12-02 17:10:08,907 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,913 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,923 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-12-02 17:10:08,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-12-02 17:10:08,929 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:08,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-12-02 17:10:08,931 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,935 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,937 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-02 17:10:08,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:10:08,947 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 68 [2018-12-02 17:10:08,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:08,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-12-02 17:10:08,961 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,963 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,965 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 17:10:08,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-02 17:10:08,976 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,977 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 17:10:08,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-02 17:10:08,980 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,981 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:08,984 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 17:10:08,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:10:08,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:10:08,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:08,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:10:09,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:10:09,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:09,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:09,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:09,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 17:10:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 276 proven. 17 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-12-02 17:10:09,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:10:09,034 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:09,034 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 17:10:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 17:10:09,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:10:09,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 17:10:09,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:09,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:09,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:09,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:10:09,082 INFO L87 Difference]: Start difference. First operand 2639 states and 4127 transitions. Second operand 4 states. [2018-12-02 17:10:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:09,632 INFO L93 Difference]: Finished difference Result 5786 states and 9036 transitions. [2018-12-02 17:10:09,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:09,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-02 17:10:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:09,635 INFO L225 Difference]: With dead ends: 5786 [2018-12-02 17:10:09,635 INFO L226 Difference]: Without dead ends: 3174 [2018-12-02 17:10:09,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:10:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2018-12-02 17:10:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2703. [2018-12-02 17:10:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-12-02 17:10:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4213 transitions. [2018-12-02 17:10:09,809 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4213 transitions. Word has length 225 [2018-12-02 17:10:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:09,810 INFO L480 AbstractCegarLoop]: Abstraction has 2703 states and 4213 transitions. [2018-12-02 17:10:09,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4213 transitions. [2018-12-02 17:10:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 17:10:09,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:09,812 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:09,812 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:09,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 220527677, now seen corresponding path program 1 times [2018-12-02 17:10:09,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:09,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:09,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:09,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:09,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:09,883 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 312 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 17:10:09,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:09,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:10:09,883 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-12-02 17:10:09,883 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [74], [77], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:10:09,885 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:10:09,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:10:10,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:10:10,184 INFO L272 AbstractInterpreter]: Visited 97 different actions 330 times. Merged at 75 different actions 211 times. Never widened. Performed 2933 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2933 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 17:10:10,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:10,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:10:10,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:10,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:10:10,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:10,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:10:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:10,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:10,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 17:10:10,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 17:10:10,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 17:10:10,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 17:10:10,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 17:10:10,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-02 17:10:10,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-02 17:10:10,326 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-02 17:10:10,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-12-02 17:10:10,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 17:10:10,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-12-02 17:10:10,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 17:10:10,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 17:10:10,385 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,389 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:10,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-02 17:10:10,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2018-12-02 17:10:10,391 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,392 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-12-02 17:10:10,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:10:10,418 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-12-02 17:10:10,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 17:10:10,427 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,429 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,432 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 17:10:10,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-02 17:10:10,447 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-12-02 17:10:10,476 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-12-02 17:10:10,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 17:10:10,509 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,518 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 64 [2018-12-02 17:10:10,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-12-02 17:10:10,549 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:10,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-12-02 17:10:10,568 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,576 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:10,593 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 17:10:10,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:10:10,596 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,597 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:10,604 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 17:10:10,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:10:10,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:10:10,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:10:10,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:10:10,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:10,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 17:10:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 283 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-02 17:10:10,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:10:10,659 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:10,659 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 17:10:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 17:10:10,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:10:10,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 17:10:10,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:10,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:10:10,691 INFO L87 Difference]: Start difference. First operand 2703 states and 4213 transitions. Second operand 4 states. [2018-12-02 17:10:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:11,210 INFO L93 Difference]: Finished difference Result 5754 states and 8932 transitions. [2018-12-02 17:10:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:11,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-12-02 17:10:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:11,213 INFO L225 Difference]: With dead ends: 5754 [2018-12-02 17:10:11,213 INFO L226 Difference]: Without dead ends: 3078 [2018-12-02 17:10:11,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:10:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2018-12-02 17:10:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2703. [2018-12-02 17:10:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-12-02 17:10:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4195 transitions. [2018-12-02 17:10:11,387 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4195 transitions. Word has length 226 [2018-12-02 17:10:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:11,387 INFO L480 AbstractCegarLoop]: Abstraction has 2703 states and 4195 transitions. [2018-12-02 17:10:11,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4195 transitions. [2018-12-02 17:10:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-02 17:10:11,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:11,389 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:11,389 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:11,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:11,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1711019319, now seen corresponding path program 1 times [2018-12-02 17:10:11,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:11,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:11,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 17:10:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:11,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:11,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:11,445 INFO L87 Difference]: Start difference. First operand 2703 states and 4195 transitions. Second operand 4 states. [2018-12-02 17:10:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:11,869 INFO L93 Difference]: Finished difference Result 5515 states and 8526 transitions. [2018-12-02 17:10:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:11,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2018-12-02 17:10:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:11,872 INFO L225 Difference]: With dead ends: 5515 [2018-12-02 17:10:11,872 INFO L226 Difference]: Without dead ends: 2839 [2018-12-02 17:10:11,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-12-02 17:10:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2746. [2018-12-02 17:10:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2746 states. [2018-12-02 17:10:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4246 transitions. [2018-12-02 17:10:12,045 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4246 transitions. Word has length 228 [2018-12-02 17:10:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:12,046 INFO L480 AbstractCegarLoop]: Abstraction has 2746 states and 4246 transitions. [2018-12-02 17:10:12,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4246 transitions. [2018-12-02 17:10:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-02 17:10:12,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:12,047 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:12,047 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:12,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:12,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1393273928, now seen corresponding path program 1 times [2018-12-02 17:10:12,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:12,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:12,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:10:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:12,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:12,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:12,158 INFO L87 Difference]: Start difference. First operand 2746 states and 4246 transitions. Second operand 5 states. [2018-12-02 17:10:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:12,765 INFO L93 Difference]: Finished difference Result 5852 states and 9010 transitions. [2018-12-02 17:10:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:12,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2018-12-02 17:10:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:12,768 INFO L225 Difference]: With dead ends: 5852 [2018-12-02 17:10:12,768 INFO L226 Difference]: Without dead ends: 3133 [2018-12-02 17:10:12,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2018-12-02 17:10:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2742. [2018-12-02 17:10:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2742 states. [2018-12-02 17:10:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2742 states and 4242 transitions. [2018-12-02 17:10:12,949 INFO L78 Accepts]: Start accepts. Automaton has 2742 states and 4242 transitions. Word has length 229 [2018-12-02 17:10:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:12,949 INFO L480 AbstractCegarLoop]: Abstraction has 2742 states and 4242 transitions. [2018-12-02 17:10:12,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2742 states and 4242 transitions. [2018-12-02 17:10:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-02 17:10:12,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:12,952 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:12,952 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 602895087, now seen corresponding path program 1 times [2018-12-02 17:10:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:12,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:12,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 17:10:13,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:13,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:13,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:13,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:13,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:13,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:13,014 INFO L87 Difference]: Start difference. First operand 2742 states and 4242 transitions. Second operand 4 states. [2018-12-02 17:10:13,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:13,440 INFO L93 Difference]: Finished difference Result 5558 states and 8577 transitions. [2018-12-02 17:10:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:13,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2018-12-02 17:10:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:13,442 INFO L225 Difference]: With dead ends: 5558 [2018-12-02 17:10:13,443 INFO L226 Difference]: Without dead ends: 2835 [2018-12-02 17:10:13,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2018-12-02 17:10:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2766. [2018-12-02 17:10:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2766 states. [2018-12-02 17:10:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2766 states and 4270 transitions. [2018-12-02 17:10:13,619 INFO L78 Accepts]: Start accepts. Automaton has 2766 states and 4270 transitions. Word has length 229 [2018-12-02 17:10:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:13,620 INFO L480 AbstractCegarLoop]: Abstraction has 2766 states and 4270 transitions. [2018-12-02 17:10:13,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2766 states and 4270 transitions. [2018-12-02 17:10:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-02 17:10:13,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:13,621 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:13,621 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:13,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:13,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1863067616, now seen corresponding path program 1 times [2018-12-02 17:10:13,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:13,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:13,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:13,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 17:10:13,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:13,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:13,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:13,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:13,702 INFO L87 Difference]: Start difference. First operand 2766 states and 4270 transitions. Second operand 5 states. [2018-12-02 17:10:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:14,342 INFO L93 Difference]: Finished difference Result 5871 states and 9034 transitions. [2018-12-02 17:10:14,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:14,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2018-12-02 17:10:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:14,345 INFO L225 Difference]: With dead ends: 5871 [2018-12-02 17:10:14,345 INFO L226 Difference]: Without dead ends: 3124 [2018-12-02 17:10:14,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2018-12-02 17:10:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 2747. [2018-12-02 17:10:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-12-02 17:10:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 4249 transitions. [2018-12-02 17:10:14,523 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 4249 transitions. Word has length 230 [2018-12-02 17:10:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:14,524 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 4249 transitions. [2018-12-02 17:10:14,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4249 transitions. [2018-12-02 17:10:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-02 17:10:14,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:14,525 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:10:14,525 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:14,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1784659630, now seen corresponding path program 2 times [2018-12-02 17:10:14,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:14,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:14,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 61 proven. 380 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:10:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:14,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:10:14,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 17:10:14,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 17:10:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:14,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:10:14,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:10:14,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 17:10:15,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 17:10:15,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:10:15,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:15,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 17:10:15,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:10:15,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:15,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:15,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-02 17:10:15,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:10:15,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:15,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 17:10:15,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-12-02 17:10:15,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:15,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:15,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 73 [2018-12-02 17:10:15,907 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 67 [2018-12-02 17:10:16,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 17:10:16,022 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 103 [2018-12-02 17:10:16,077 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,122 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:10:16,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-02 17:10:16,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,224 INFO L478 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 30 treesize of output 73 [2018-12-02 17:10:16,224 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,235 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 66 [2018-12-02 17:10:16,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,323 INFO L478 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 49 treesize of output 68 [2018-12-02 17:10:16,323 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 17:10:16,370 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,408 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,446 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:10:16,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:10:16,523 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:16,527 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:16,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 117 [2018-12-02 17:10:16,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 88 [2018-12-02 17:10:16,581 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2018-12-02 17:10:16,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,601 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:16,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 115 [2018-12-02 17:10:16,604 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,610 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,617 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 140 [2018-12-02 17:10:16,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-12-02 17:10:16,641 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:16,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 122 [2018-12-02 17:10:16,780 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:16,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 101 [2018-12-02 17:10:16,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:16,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 47 [2018-12-02 17:10:17,003 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,014 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-12-02 17:10:17,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-02 17:10:17,021 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,031 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 135 [2018-12-02 17:10:17,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 17:10:17,185 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 148 [2018-12-02 17:10:17,252 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:17,321 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:17,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 134 [2018-12-02 17:10:17,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,435 INFO L478 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 124 treesize of output 128 [2018-12-02 17:10:17,436 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 17:10:17,505 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,564 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:17,601 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:17,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 131 [2018-12-02 17:10:17,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 124 [2018-12-02 17:10:17,611 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-12-02 17:10:17,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 146 [2018-12-02 17:10:17,634 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,645 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,655 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,720 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,729 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,730 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,738 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,739 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,746 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,747 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,757 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:17,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 107 [2018-12-02 17:10:17,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 118 [2018-12-02 17:10:17,879 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2018-12-02 17:10:17,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:17,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 167 [2018-12-02 17:10:17,898 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,906 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,913 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 125 [2018-12-02 17:10:17,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-12-02 17:10:17,930 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:17,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 116 [2018-12-02 17:10:17,983 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:18,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2018-12-02 17:10:18,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2018-12-02 17:10:18,048 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,056 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-12-02 17:10:18,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-02 17:10:18,112 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,120 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2018-12-02 17:10:18,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 134 [2018-12-02 17:10:18,130 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,140 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,186 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:18,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 78 [2018-12-02 17:10:18,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 70 [2018-12-02 17:10:18,194 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-02 17:10:18,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,208 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:18,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 17:10:18,211 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,215 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,219 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2018-12-02 17:10:18,223 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:18,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 42 [2018-12-02 17:10:18,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:10:18,227 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,231 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,236 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 17:10:18,276 INFO L202 ElimStorePlain]: Needed 67 recursive calls to eliminate 6 variables, input treesize:268, output treesize:245 [2018-12-02 17:10:18,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 95 [2018-12-02 17:10:18,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-02 17:10:18,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 99 [2018-12-02 17:10:18,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 138 [2018-12-02 17:10:18,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 152 [2018-12-02 17:10:18,673 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 17:10:18,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:10:18,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 126 [2018-12-02 17:10:18,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:18,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:18,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 98 [2018-12-02 17:10:18,908 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:18,922 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-12-02 17:10:19,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,066 INFO L478 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 50 treesize of output 46 [2018-12-02 17:10:19,067 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-12-02 17:10:19,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:10:19,079 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,086 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 91 [2018-12-02 17:10:19,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-12-02 17:10:19,093 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,101 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 109 [2018-12-02 17:10:19,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-12-02 17:10:19,211 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,220 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2018-12-02 17:10:19,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-12-02 17:10:19,307 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,318 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 123 [2018-12-02 17:10:19,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 161 [2018-12-02 17:10:19,407 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 158 [2018-12-02 17:10:19,457 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,487 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:19,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2018-12-02 17:10:19,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-02 17:10:19,559 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,566 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 82 [2018-12-02 17:10:19,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,571 INFO L478 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 61 treesize of output 59 [2018-12-02 17:10:19,571 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,579 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88 [2018-12-02 17:10:19,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-12-02 17:10:19,650 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,656 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-02 17:10:19,704 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 9 variables, input treesize:330, output treesize:434 [2018-12-02 17:10:19,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-12-02 17:10:19,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2018-12-02 17:10:19,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 17:10:19,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 17:10:19,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 17:10:19,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-02 17:10:19,884 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2018-12-02 17:10:19,896 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:19,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 64 [2018-12-02 17:10:19,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-12-02 17:10:19,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:19,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:19,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 92 [2018-12-02 17:10:19,984 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-12-02 17:10:20,025 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 17:10:20,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-02 17:10:20,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 17:10:20,078 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-02 17:10:20,102 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:10:20,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 17:10:20,170 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:482, output treesize:145 [2018-12-02 17:10:20,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2018-12-02 17:10:20,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 17:10:20,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2018-12-02 17:10:20,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:10:20,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-12-02 17:10:20,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:20,309 INFO L478 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 25 treesize of output 19 [2018-12-02 17:10:20,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-12-02 17:10:20,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:10:20,329 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:20,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:20,339 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-02 17:10:20,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:20,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:21,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 235 [2018-12-02 17:10:21,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:10:21,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:21,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-12-02 17:10:21,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 17:10:21,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:21,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:21,477 INFO L478 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 18 treesize of output 37 [2018-12-02 17:10:21,477 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:21,489 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:21,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:21,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 203 [2018-12-02 17:10:22,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:10:22,228 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2018-12-02 17:10:22,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:22,282 INFO L478 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 106 treesize of output 110 [2018-12-02 17:10:22,282 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,296 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,322 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2018-12-02 17:10:22,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:22,802 INFO L478 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 106 treesize of output 110 [2018-12-02 17:10:22,802 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:22,824 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:23,166 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:23,285 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:23,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 152 [2018-12-02 17:10:23,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:10:23,626 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:23,639 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:23,906 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:23,999 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:24,199 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:24,211 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:24,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 91 [2018-12-02 17:10:24,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:24,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-12-02 17:10:24,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:24,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:24,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:24,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2018-12-02 17:10:24,421 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:24,427 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:24,436 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:24,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 281 treesize of output 260 [2018-12-02 17:10:24,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:24,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 326 [2018-12-02 17:10:24,669 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:27,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 256 [2018-12-02 17:10:27,704 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 237 [2018-12-02 17:10:29,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:29,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 196 [2018-12-02 17:10:29,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:29,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:29,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:29,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 214 [2018-12-02 17:10:29,888 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:29,920 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:29,999 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:31,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 236 [2018-12-02 17:10:31,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 211 [2018-12-02 17:10:31,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:31,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 334 [2018-12-02 17:10:31,374 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:31,403 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:31,456 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,013 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,092 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:32,138 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:32,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 214 [2018-12-02 17:10:32,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 178 [2018-12-02 17:10:32,242 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,324 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 134 [2018-12-02 17:10:32,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:10:32,373 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 64 [2018-12-02 17:10:32,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,410 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2018-12-02 17:10:32,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 112 [2018-12-02 17:10:32,417 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,428 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2018-12-02 17:10:32,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,448 INFO L478 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 18 treesize of output 37 [2018-12-02 17:10:32,448 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,456 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,465 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,481 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 126 [2018-12-02 17:10:32,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 70 [2018-12-02 17:10:32,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2018-12-02 17:10:32,525 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,531 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,543 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:32,568 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-02 17:10:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 94 [2018-12-02 17:10:32,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,637 INFO L478 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 73 treesize of output 71 [2018-12-02 17:10:32,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-12-02 17:10:32,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-12-02 17:10:32,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:32,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:32,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 111 [2018-12-02 17:10:32,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 131 [2018-12-02 17:10:32,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 140 [2018-12-02 17:10:32,796 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:32,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-12-02 17:10:32,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,888 INFO L478 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 57 treesize of output 55 [2018-12-02 17:10:32,888 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,895 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-12-02 17:10:32,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:10:32,902 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,910 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 103 [2018-12-02 17:10:32,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:32,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 105 [2018-12-02 17:10:32,952 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,963 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:32,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-12-02 17:10:32,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 17:10:32,990 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:32,996 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 17:10:33,019 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:209, output treesize:185 [2018-12-02 17:10:33,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-12-02 17:10:33,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-12-02 17:10:33,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-12-02 17:10:33,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 17:10:33,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 17:10:33,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:91 [2018-12-02 17:10:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 354 proven. 87 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:10:33,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:10:33,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2018-12-02 17:10:33,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,685 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,688 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 99 [2018-12-02 17:10:33,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-02 17:10:33,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:33,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-12-02 17:10:33,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,743 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,744 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 68 [2018-12-02 17:10:33,757 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,758 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,759 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,760 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,760 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,760 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-12-02 17:10:33,761 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,768 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,778 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,781 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:10:33,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-12-02 17:10:33,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-12-02 17:10:33,785 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-12-02 17:10:33,793 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,796 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,807 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:10:33,823 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,825 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:33,825 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,832 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 17:10:33,841 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:274, output treesize:206 [2018-12-02 17:10:33,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:93 [2018-12-02 17:10:33,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:33,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:34,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:34,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:34,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:34,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:116 [2018-12-02 17:10:34,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:34,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:34,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:34,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:445, output treesize:1 [2018-12-02 17:10:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 325 proven. 116 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 17:10:34,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:10:34,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 12] total 36 [2018-12-02 17:10:34,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:10:34,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 17:10:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 17:10:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 17:10:34,310 INFO L87 Difference]: Start difference. First operand 2747 states and 4249 transitions. Second operand 26 states. [2018-12-02 17:10:40,466 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2018-12-02 17:10:40,700 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-12-02 17:10:46,282 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2018-12-02 17:10:47,154 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-12-02 17:10:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:48,752 INFO L93 Difference]: Finished difference Result 16095 states and 24283 transitions. [2018-12-02 17:10:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-02 17:10:48,752 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 239 [2018-12-02 17:10:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:48,761 INFO L225 Difference]: With dead ends: 16095 [2018-12-02 17:10:48,761 INFO L226 Difference]: Without dead ends: 13375 [2018-12-02 17:10:48,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 456 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1116, Invalid=5046, Unknown=0, NotChecked=0, Total=6162 [2018-12-02 17:10:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13375 states. [2018-12-02 17:10:49,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13375 to 6686. [2018-12-02 17:10:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6686 states. [2018-12-02 17:10:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 10709 transitions. [2018-12-02 17:10:49,256 INFO L78 Accepts]: Start accepts. Automaton has 6686 states and 10709 transitions. Word has length 239 [2018-12-02 17:10:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:49,256 INFO L480 AbstractCegarLoop]: Abstraction has 6686 states and 10709 transitions. [2018-12-02 17:10:49,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 17:10:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6686 states and 10709 transitions. [2018-12-02 17:10:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-02 17:10:49,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:49,258 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:49,258 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:49,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 305545159, now seen corresponding path program 1 times [2018-12-02 17:10:49,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:49,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:10:49,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:49,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-12-02 17:10:49,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:49,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:49,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:49,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:49,321 INFO L87 Difference]: Start difference. First operand 6686 states and 10709 transitions. Second operand 4 states. [2018-12-02 17:10:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:49,969 INFO L93 Difference]: Finished difference Result 13404 states and 21463 transitions. [2018-12-02 17:10:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:49,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-12-02 17:10:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:49,974 INFO L225 Difference]: With dead ends: 13404 [2018-12-02 17:10:49,974 INFO L226 Difference]: Without dead ends: 6745 [2018-12-02 17:10:49,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6745 states. [2018-12-02 17:10:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6745 to 6686. [2018-12-02 17:10:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6686 states. [2018-12-02 17:10:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 10706 transitions. [2018-12-02 17:10:50,452 INFO L78 Accepts]: Start accepts. Automaton has 6686 states and 10706 transitions. Word has length 242 [2018-12-02 17:10:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:50,452 INFO L480 AbstractCegarLoop]: Abstraction has 6686 states and 10706 transitions. [2018-12-02 17:10:50,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6686 states and 10706 transitions. [2018-12-02 17:10:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-02 17:10:50,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:50,454 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:50,454 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:50,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1398645564, now seen corresponding path program 1 times [2018-12-02 17:10:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:50,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:50,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-02 17:10:50,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:50,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:50,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:50,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:50,553 INFO L87 Difference]: Start difference. First operand 6686 states and 10706 transitions. Second operand 5 states. [2018-12-02 17:10:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:51,588 INFO L93 Difference]: Finished difference Result 14382 states and 22929 transitions. [2018-12-02 17:10:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:51,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-12-02 17:10:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:51,594 INFO L225 Difference]: With dead ends: 14382 [2018-12-02 17:10:51,594 INFO L226 Difference]: Without dead ends: 7723 [2018-12-02 17:10:51,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2018-12-02 17:10:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 7106. [2018-12-02 17:10:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7106 states. [2018-12-02 17:10:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 11402 transitions. [2018-12-02 17:10:52,098 INFO L78 Accepts]: Start accepts. Automaton has 7106 states and 11402 transitions. Word has length 249 [2018-12-02 17:10:52,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:52,098 INFO L480 AbstractCegarLoop]: Abstraction has 7106 states and 11402 transitions. [2018-12-02 17:10:52,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7106 states and 11402 transitions. [2018-12-02 17:10:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-02 17:10:52,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:52,100 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:52,100 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:52,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2132609564, now seen corresponding path program 1 times [2018-12-02 17:10:52,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:52,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:52,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:52,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 17:10:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:52,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:52,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:52,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:52,168 INFO L87 Difference]: Start difference. First operand 7106 states and 11402 transitions. Second operand 4 states. [2018-12-02 17:10:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:53,066 INFO L93 Difference]: Finished difference Result 14531 states and 23224 transitions. [2018-12-02 17:10:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:53,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-12-02 17:10:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:53,072 INFO L225 Difference]: With dead ends: 14531 [2018-12-02 17:10:53,072 INFO L226 Difference]: Without dead ends: 7452 [2018-12-02 17:10:53,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2018-12-02 17:10:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7106. [2018-12-02 17:10:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7106 states. [2018-12-02 17:10:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 11394 transitions. [2018-12-02 17:10:53,577 INFO L78 Accepts]: Start accepts. Automaton has 7106 states and 11394 transitions. Word has length 250 [2018-12-02 17:10:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:53,578 INFO L480 AbstractCegarLoop]: Abstraction has 7106 states and 11394 transitions. [2018-12-02 17:10:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7106 states and 11394 transitions. [2018-12-02 17:10:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-02 17:10:53,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:53,580 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:53,580 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:53,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash 48964855, now seen corresponding path program 1 times [2018-12-02 17:10:53,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:53,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:53,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 17:10:53,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:53,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:53,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:53,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:53,668 INFO L87 Difference]: Start difference. First operand 7106 states and 11394 transitions. Second operand 4 states. [2018-12-02 17:10:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:54,591 INFO L93 Difference]: Finished difference Result 14531 states and 23208 transitions. [2018-12-02 17:10:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:54,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-12-02 17:10:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:54,597 INFO L225 Difference]: With dead ends: 14531 [2018-12-02 17:10:54,597 INFO L226 Difference]: Without dead ends: 7452 [2018-12-02 17:10:54,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2018-12-02 17:10:55,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7054. [2018-12-02 17:10:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7054 states. [2018-12-02 17:10:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 11314 transitions. [2018-12-02 17:10:55,103 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 11314 transitions. Word has length 251 [2018-12-02 17:10:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:55,103 INFO L480 AbstractCegarLoop]: Abstraction has 7054 states and 11314 transitions. [2018-12-02 17:10:55,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 11314 transitions. [2018-12-02 17:10:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 17:10:55,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:55,105 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:55,105 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:55,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:55,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1633142025, now seen corresponding path program 1 times [2018-12-02 17:10:55,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:55,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 17:10:55,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:55,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:10:55,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:55,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:10:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:10:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:10:55,186 INFO L87 Difference]: Start difference. First operand 7054 states and 11314 transitions. Second operand 4 states. [2018-12-02 17:10:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:56,092 INFO L93 Difference]: Finished difference Result 14427 states and 23048 transitions. [2018-12-02 17:10:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:56,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2018-12-02 17:10:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:56,100 INFO L225 Difference]: With dead ends: 14427 [2018-12-02 17:10:56,100 INFO L226 Difference]: Without dead ends: 7400 [2018-12-02 17:10:56,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7400 states. [2018-12-02 17:10:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7400 to 7054. [2018-12-02 17:10:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7054 states. [2018-12-02 17:10:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 11282 transitions. [2018-12-02 17:10:56,612 INFO L78 Accepts]: Start accepts. Automaton has 7054 states and 11282 transitions. Word has length 252 [2018-12-02 17:10:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:56,612 INFO L480 AbstractCegarLoop]: Abstraction has 7054 states and 11282 transitions. [2018-12-02 17:10:56,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:10:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7054 states and 11282 transitions. [2018-12-02 17:10:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-02 17:10:56,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:56,614 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:56,614 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:56,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1877873660, now seen corresponding path program 1 times [2018-12-02 17:10:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:56,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:56,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-12-02 17:10:56,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:10:56,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:10:56,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:10:56,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:10:56,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:10:56,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:10:56,706 INFO L87 Difference]: Start difference. First operand 7054 states and 11282 transitions. Second operand 5 states. [2018-12-02 17:10:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:10:57,724 INFO L93 Difference]: Finished difference Result 14654 states and 23289 transitions. [2018-12-02 17:10:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:10:57,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2018-12-02 17:10:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:10:57,731 INFO L225 Difference]: With dead ends: 14654 [2018-12-02 17:10:57,731 INFO L226 Difference]: Without dead ends: 7627 [2018-12-02 17:10:57,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:10:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2018-12-02 17:10:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 7022. [2018-12-02 17:10:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:10:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11214 transitions. [2018-12-02 17:10:58,250 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11214 transitions. Word has length 253 [2018-12-02 17:10:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:10:58,250 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11214 transitions. [2018-12-02 17:10:58,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:10:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11214 transitions. [2018-12-02 17:10:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-02 17:10:58,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:10:58,252 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:10:58,252 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:10:58,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash -534654858, now seen corresponding path program 1 times [2018-12-02 17:10:58,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:10:58,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:58,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:10:58,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:10:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 17:10:58,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:58,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:10:58,731 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-12-02 17:10:58,731 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [47], [49], [54], [59], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [222], [224], [227], [231], [235], [250], [256], [266], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:10:58,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:10:58,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:10:59,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:10:59,033 INFO L272 AbstractInterpreter]: Visited 97 different actions 330 times. Merged at 75 different actions 211 times. Never widened. Performed 2961 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 15 different actions. Largest state had 148 variables. [2018-12-02 17:10:59,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:10:59,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:10:59,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:10:59,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:10:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:10:59,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:10:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:10:59,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:10:59,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,152 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-02 17:10:59,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 17:10:59,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 17:10:59,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-02 17:10:59,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-02 17:10:59,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-02 17:10:59,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 17:10:59,210 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,216 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,219 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,230 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 17:10:59,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 17:10:59,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 17:10:59,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 17:10:59,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 17:10:59,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,339 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,351 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,365 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 17:10:59,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:10:59,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:10:59,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:10:59,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:10:59,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:10:59,466 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,496 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:10:59,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:10:59,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 17:10:59,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 17:10:59,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 17:10:59,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 17:10:59,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,616 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:10:59,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 17:10:59,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 17:10:59,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 17:10:59,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-02 17:10:59,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 17:10:59,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 17:10:59,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 17:10:59,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 17:10:59,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-02 17:10:59,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-02 17:10:59,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 17:10:59,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-12-02 17:10:59,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 17:10:59,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:10:59,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 337 [2018-12-02 17:10:59,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:10:59,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 369 [2018-12-02 17:10:59,931 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:10:59,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 290 [2018-12-02 17:11:00,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:11:00,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 250 [2018-12-02 17:11:00,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 347 [2018-12-02 17:11:00,087 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,131 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,159 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 181 [2018-12-02 17:11:00,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:11:00,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,247 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-02 17:11:00,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:00,281 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-02 17:11:00,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:11:00,296 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-02 17:11:00,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,311 INFO L478 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 18 treesize of output 37 [2018-12-02 17:11:00,311 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,319 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,325 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,330 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-02 17:11:00,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 17:11:00,352 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,356 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,369 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 17:11:00,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-12-02 17:11:00,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-02 17:11:00,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 17:11:00,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-12-02 17:11:00,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-12-02 17:11:00,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-12-02 17:11:00,446 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,457 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 17:11:00,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-02 17:11:00,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-02 17:11:00,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,486 INFO L478 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 22 treesize of output 16 [2018-12-02 17:11:00,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-02 17:11:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 17:11:00,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:11:00,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,776 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,798 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,802 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 273 [2018-12-02 17:11:00,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:00,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 245 [2018-12-02 17:11:00,825 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 170 [2018-12-02 17:11:00,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 17:11:00,842 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 140 [2018-12-02 17:11:00,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,863 INFO L478 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 31 treesize of output 70 [2018-12-02 17:11:00,863 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 179 [2018-12-02 17:11:00,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-12-02 17:11:00,878 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,884 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,884 INFO L478 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 17 treesize of output 7 [2018-12-02 17:11:00,884 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,887 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2018-12-02 17:11:00,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,896 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,896 INFO L478 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 129 treesize of output 120 [2018-12-02 17:11:00,897 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 94 [2018-12-02 17:11:00,913 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,924 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,924 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,925 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:00,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-12-02 17:11:00,926 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,934 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:00,942 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:00,949 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:00,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-12-02 17:11:00,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-02 17:11:00,962 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,963 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:00,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,965 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:15 [2018-12-02 17:11:00,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-12-02 17:11:00,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-12-02 17:11:00,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 17:11:00,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:00,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 17:11:00,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-02 17:11:01,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-02 17:11:01,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 17:11:01,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 17:11:01,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:11:01,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:11:01,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,046 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 17:11:01,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:11:01,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 17:11:01,064 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,077 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,078 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:01,079 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:25 [2018-12-02 17:11:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 17:11:01,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:11:01,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-02 17:11:01,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:11:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 17:11:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 17:11:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-02 17:11:01,179 INFO L87 Difference]: Start difference. First operand 7022 states and 11214 transitions. Second operand 13 states. [2018-12-02 17:11:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:04,256 INFO L93 Difference]: Finished difference Result 18442 states and 28930 transitions. [2018-12-02 17:11:04,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:11:04,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2018-12-02 17:11:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:04,264 INFO L225 Difference]: With dead ends: 18442 [2018-12-02 17:11:04,264 INFO L226 Difference]: Without dead ends: 11447 [2018-12-02 17:11:04,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 489 SyntacticMatches, 23 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-12-02 17:11:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2018-12-02 17:11:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 7022. [2018-12-02 17:11:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11194 transitions. [2018-12-02 17:11:04,785 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11194 transitions. Word has length 253 [2018-12-02 17:11:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:04,785 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11194 transitions. [2018-12-02 17:11:04,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 17:11:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11194 transitions. [2018-12-02 17:11:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-02 17:11:04,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:04,788 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:11:04,788 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -580420662, now seen corresponding path program 1 times [2018-12-02 17:11:04,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:04,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:04,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 17:11:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:11:04,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:04,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:04,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:04,839 INFO L87 Difference]: Start difference. First operand 7022 states and 11194 transitions. Second operand 4 states. [2018-12-02 17:11:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:05,601 INFO L93 Difference]: Finished difference Result 14076 states and 22433 transitions. [2018-12-02 17:11:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:05,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-12-02 17:11:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:05,606 INFO L225 Difference]: With dead ends: 14076 [2018-12-02 17:11:05,606 INFO L226 Difference]: Without dead ends: 7081 [2018-12-02 17:11:05,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7081 states. [2018-12-02 17:11:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7081 to 7022. [2018-12-02 17:11:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11191 transitions. [2018-12-02 17:11:06,139 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11191 transitions. Word has length 259 [2018-12-02 17:11:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:06,139 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11191 transitions. [2018-12-02 17:11:06,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11191 transitions. [2018-12-02 17:11:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-02 17:11:06,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:06,141 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 17:11:06,141 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:06,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash 825202071, now seen corresponding path program 1 times [2018-12-02 17:11:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:06,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:06,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:06,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 17:11:06,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:06,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:11:06,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:06,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:06,190 INFO L87 Difference]: Start difference. First operand 7022 states and 11191 transitions. Second operand 4 states. [2018-12-02 17:11:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:06,899 INFO L93 Difference]: Finished difference Result 14070 states and 22418 transitions. [2018-12-02 17:11:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:06,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2018-12-02 17:11:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:06,907 INFO L225 Difference]: With dead ends: 14070 [2018-12-02 17:11:06,907 INFO L226 Difference]: Without dead ends: 7075 [2018-12-02 17:11:06,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2018-12-02 17:11:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7022. [2018-12-02 17:11:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11188 transitions. [2018-12-02 17:11:07,422 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11188 transitions. Word has length 260 [2018-12-02 17:11:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11188 transitions. [2018-12-02 17:11:07,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11188 transitions. [2018-12-02 17:11:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-02 17:11:07,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:07,426 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:07,426 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:07,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1599344991, now seen corresponding path program 1 times [2018-12-02 17:11:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:07,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 17:11:07,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:07,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:11:07,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:07,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:07,512 INFO L87 Difference]: Start difference. First operand 7022 states and 11188 transitions. Second operand 4 states. [2018-12-02 17:11:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:08,200 INFO L93 Difference]: Finished difference Result 14070 states and 22412 transitions. [2018-12-02 17:11:08,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:08,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-12-02 17:11:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:08,206 INFO L225 Difference]: With dead ends: 14070 [2018-12-02 17:11:08,206 INFO L226 Difference]: Without dead ends: 7075 [2018-12-02 17:11:08,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2018-12-02 17:11:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7022. [2018-12-02 17:11:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11185 transitions. [2018-12-02 17:11:08,720 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11185 transitions. Word has length 281 [2018-12-02 17:11:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:08,720 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11185 transitions. [2018-12-02 17:11:08,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11185 transitions. [2018-12-02 17:11:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-02 17:11:08,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:08,723 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:08,723 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:08,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1687697394, now seen corresponding path program 1 times [2018-12-02 17:11:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:08,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:08,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 17:11:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:11:08,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:08,774 INFO L87 Difference]: Start difference. First operand 7022 states and 11185 transitions. Second operand 4 states. [2018-12-02 17:11:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:09,448 INFO L93 Difference]: Finished difference Result 14058 states and 22391 transitions. [2018-12-02 17:11:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:09,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-12-02 17:11:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:09,453 INFO L225 Difference]: With dead ends: 14058 [2018-12-02 17:11:09,453 INFO L226 Difference]: Without dead ends: 7063 [2018-12-02 17:11:09,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2018-12-02 17:11:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7022. [2018-12-02 17:11:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11182 transitions. [2018-12-02 17:11:09,964 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11182 transitions. Word has length 282 [2018-12-02 17:11:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:09,964 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11182 transitions. [2018-12-02 17:11:09,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11182 transitions. [2018-12-02 17:11:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 17:11:09,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:09,967 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:09,967 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:09,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1107594954, now seen corresponding path program 1 times [2018-12-02 17:11:09,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:09,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:09,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-12-02 17:11:10,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:10,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:11:10,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:10,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:11:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:11:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:10,046 INFO L87 Difference]: Start difference. First operand 7022 states and 11182 transitions. Second operand 5 states. [2018-12-02 17:11:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:11,112 INFO L93 Difference]: Finished difference Result 14710 states and 23285 transitions. [2018-12-02 17:11:11,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:11,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2018-12-02 17:11:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:11,118 INFO L225 Difference]: With dead ends: 14710 [2018-12-02 17:11:11,119 INFO L226 Difference]: Without dead ends: 7715 [2018-12-02 17:11:11,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:11:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2018-12-02 17:11:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7022. [2018-12-02 17:11:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2018-12-02 17:11:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 11134 transitions. [2018-12-02 17:11:11,636 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 11134 transitions. Word has length 284 [2018-12-02 17:11:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:11,636 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 11134 transitions. [2018-12-02 17:11:11,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:11:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 11134 transitions. [2018-12-02 17:11:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 17:11:11,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:11,638 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:11,639 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:11,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash -73939722, now seen corresponding path program 1 times [2018-12-02 17:11:11,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:11,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 548 proven. 15 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 17:11:11,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:11,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:11:11,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-02 17:11:11,723 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [67], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:11:11,724 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:11:11,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:11:11,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:11:11,972 INFO L272 AbstractInterpreter]: Visited 100 different actions 342 times. Merged at 81 different actions 217 times. Never widened. Performed 2719 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2719 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 18 different actions. Largest state had 151 variables. [2018-12-02 17:11:11,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:11,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:11:11,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:11,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:11:11,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:11,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:11:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:12,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:12,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-02 17:11:12,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:12,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 80 [2018-12-02 17:11:12,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 30 [2018-12-02 17:11:12,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 101 [2018-12-02 17:11:12,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-12-02 17:11:12,142 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 90 [2018-12-02 17:11:12,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 137 [2018-12-02 17:11:12,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 122 treesize of output 125 [2018-12-02 17:11:12,223 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-02 17:11:12,245 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,255 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:12,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 109 [2018-12-02 17:11:12,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-12-02 17:11:12,294 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-12-02 17:11:12,314 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,320 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-02 17:11:12,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:12,333 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:12,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-02 17:11:12,341 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:12,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-12-02 17:11:12,342 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,345 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,349 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-12-02 17:11:12,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-02 17:11:12,361 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,364 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-02 17:11:12,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2018-12-02 17:11:12,366 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,367 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-12-02 17:11:12,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-12-02 17:11:12,374 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,375 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:12,377 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 17:11:12,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:11:12,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:11:12,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:12,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 17:11:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 17:11:12,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:11:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 17:11:12,520 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:11:12,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 17:11:12,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:12,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:11:12,521 INFO L87 Difference]: Start difference. First operand 7022 states and 11134 transitions. Second operand 6 states. [2018-12-02 17:11:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:13,503 INFO L93 Difference]: Finished difference Result 14356 states and 22724 transitions. [2018-12-02 17:11:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:11:13,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-12-02 17:11:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:13,509 INFO L225 Difference]: With dead ends: 14356 [2018-12-02 17:11:13,509 INFO L226 Difference]: Without dead ends: 7361 [2018-12-02 17:11:13,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 563 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:11:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2018-12-02 17:11:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 7142. [2018-12-02 17:11:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7142 states. [2018-12-02 17:11:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7142 states to 7142 states and 11338 transitions. [2018-12-02 17:11:14,034 INFO L78 Accepts]: Start accepts. Automaton has 7142 states and 11338 transitions. Word has length 284 [2018-12-02 17:11:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:14,034 INFO L480 AbstractCegarLoop]: Abstraction has 7142 states and 11338 transitions. [2018-12-02 17:11:14,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7142 states and 11338 transitions. [2018-12-02 17:11:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 17:11:14,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:14,037 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:14,037 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:14,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1849484979, now seen corresponding path program 1 times [2018-12-02 17:11:14,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:14,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:14,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:14,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:14,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 548 proven. 16 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-12-02 17:11:14,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:14,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:11:14,132 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-02 17:11:14,133 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [67], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [147], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [482], [487], [594], [628], [630], [642], [645], [646], [647], [649] [2018-12-02 17:11:14,134 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:11:14,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:11:14,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:11:14,453 INFO L272 AbstractInterpreter]: Visited 100 different actions 342 times. Merged at 81 different actions 217 times. Never widened. Performed 2719 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2719 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 18 different actions. Largest state had 151 variables. [2018-12-02 17:11:14,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:14,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:11:14,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:14,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:11:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:14,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:11:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:14,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:14,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-02 17:11:14,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-12-02 17:11:14,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 17:11:14,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2018-12-02 17:11:14,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-02 17:11:14,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-12-02 17:11:14,584 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 17:11:14,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-12-02 17:11:14,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-02 17:11:14,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2018-12-02 17:11:14,620 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,621 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 17:11:14,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-12-02 17:11:14,624 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,629 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:14,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 17:11:14,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-02 17:11:14,667 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-12-02 17:11:14,694 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-12-02 17:11:14,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-12-02 17:11:14,727 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,732 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 17:11:14,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 68 treesize of output 71 [2018-12-02 17:11:14,770 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-12-02 17:11:14,792 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,801 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:14,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 17:11:14,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37 [2018-12-02 17:11:14,829 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2018-12-02 17:11:14,846 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,855 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:14,862 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 17:11:14,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:14,864 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,865 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-12-02 17:11:14,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:14,872 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-12-02 17:11:14,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:14,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-12-02 17:11:14,887 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,890 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,892 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:14,900 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 17:11:14,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 17:11:14,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 17:11:14,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:14,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 17:11:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 17:11:14,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:11:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 17:11:15,024 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:11:15,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 17:11:15,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:15,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:11:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:11:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:11:15,025 INFO L87 Difference]: Start difference. First operand 7142 states and 11338 transitions. Second operand 6 states. [2018-12-02 17:11:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:15,919 INFO L93 Difference]: Finished difference Result 14468 states and 22916 transitions. [2018-12-02 17:11:15,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:11:15,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 285 [2018-12-02 17:11:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:15,926 INFO L225 Difference]: With dead ends: 14468 [2018-12-02 17:11:15,926 INFO L226 Difference]: Without dead ends: 7353 [2018-12-02 17:11:15,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 565 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 17:11:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7353 states. [2018-12-02 17:11:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7353 to 7146. [2018-12-02 17:11:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7146 states. [2018-12-02 17:11:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 11342 transitions. [2018-12-02 17:11:16,476 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 11342 transitions. Word has length 285 [2018-12-02 17:11:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:16,476 INFO L480 AbstractCegarLoop]: Abstraction has 7146 states and 11342 transitions. [2018-12-02 17:11:16,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:11:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 11342 transitions. [2018-12-02 17:11:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-02 17:11:16,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:16,480 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:16,480 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:16,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1205077314, now seen corresponding path program 1 times [2018-12-02 17:11:16,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:16,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-12-02 17:11:16,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:11:16,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:11:16,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:11:16,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:11:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:11:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:11:16,575 INFO L87 Difference]: Start difference. First operand 7146 states and 11342 transitions. Second operand 4 states. [2018-12-02 17:11:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:17,540 INFO L93 Difference]: Finished difference Result 14571 states and 23056 transitions. [2018-12-02 17:11:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:11:17,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-12-02 17:11:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:17,548 INFO L225 Difference]: With dead ends: 14571 [2018-12-02 17:11:17,548 INFO L226 Difference]: Without dead ends: 7452 [2018-12-02 17:11:17,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:11:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7452 states. [2018-12-02 17:11:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7452 to 7146. [2018-12-02 17:11:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7146 states. [2018-12-02 17:11:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 11310 transitions. [2018-12-02 17:11:18,077 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 11310 transitions. Word has length 285 [2018-12-02 17:11:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:18,077 INFO L480 AbstractCegarLoop]: Abstraction has 7146 states and 11310 transitions. [2018-12-02 17:11:18,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:11:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 11310 transitions. [2018-12-02 17:11:18,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-02 17:11:18,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:18,081 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:18,081 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:18,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash -342782383, now seen corresponding path program 2 times [2018-12-02 17:11:18,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:11:18,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:18,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:11:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 504 proven. 269 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 17:11:18,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:18,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:11:18,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 17:11:18,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 17:11:18,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:11:18,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/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-12-02 17:11:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:11:18,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 17:11:27,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 17:11:27,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:11:28,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:11:28,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 17:11:28,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:11:28,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-02 17:11:28,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 17:11:28,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 17:11:28,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-12-02 17:11:28,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 73 [2018-12-02 17:11:28,187 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:28,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-02 17:11:28,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,280 INFO L478 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 18 treesize of output 37 [2018-12-02 17:11:28,281 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,291 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-02 17:11:28,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,362 INFO L478 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 30 treesize of output 73 [2018-12-02 17:11:28,362 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,374 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-12-02 17:11:28,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:28,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 120 [2018-12-02 17:11:28,395 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:28,432 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:28,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:11:28,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:11:28,603 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:28,606 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:28,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 140 [2018-12-02 17:11:28,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-12-02 17:11:28,671 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:28,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 123 [2018-12-02 17:11:28,806 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:29,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 127 [2018-12-02 17:11:29,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,027 INFO L478 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 106 treesize of output 110 [2018-12-02 17:11:29,028 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,038 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 135 [2018-12-02 17:11:29,193 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 17:11:29,270 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 148 [2018-12-02 17:11:29,339 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:29,375 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:29,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-12-02 17:11:29,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-02 17:11:29,439 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,450 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,478 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:29,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 125 [2018-12-02 17:11:29,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 118 [2018-12-02 17:11:29,489 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 106 [2018-12-02 17:11:29,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,512 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:29,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 145 [2018-12-02 17:11:29,516 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,526 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,534 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 131 [2018-12-02 17:11:29,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 124 [2018-12-02 17:11:29,544 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-12-02 17:11:29,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 146 [2018-12-02 17:11:29,571 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,582 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,593 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,660 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,669 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,669 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,678 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,679 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,687 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,688 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,697 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:29,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 107 [2018-12-02 17:11:29,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 118 [2018-12-02 17:11:29,821 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2018-12-02 17:11:29,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 167 [2018-12-02 17:11:29,840 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,849 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,858 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 90 [2018-12-02 17:11:29,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 70 [2018-12-02 17:11:29,865 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-02 17:11:29,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:29,880 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:29,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 17:11:29,882 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,887 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,891 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 125 [2018-12-02 17:11:29,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-12-02 17:11:29,909 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:29,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 116 [2018-12-02 17:11:29,966 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:30,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2018-12-02 17:11:30,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2018-12-02 17:11:30,038 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,047 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 120 [2018-12-02 17:11:30,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 130 [2018-12-02 17:11:30,129 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:30,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 120 [2018-12-02 17:11:30,200 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:30,255 INFO L267 ElimStorePlain]: Start of recursive call 57: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:30,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-12-02 17:11:30,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-02 17:11:30,301 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,310 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,330 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:30,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2018-12-02 17:11:30,335 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:30,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 42 [2018-12-02 17:11:30,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:11:30,340 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,345 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,353 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 17:11:30,401 INFO L202 ElimStorePlain]: Needed 64 recursive calls to eliminate 6 variables, input treesize:268, output treesize:257 [2018-12-02 17:11:30,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 126 [2018-12-02 17:11:30,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,493 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:30,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 98 [2018-12-02 17:11:30,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 113 [2018-12-02 17:11:30,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:30,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 113 [2018-12-02 17:11:30,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:30,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 126 [2018-12-02 17:11:31,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 111 [2018-12-02 17:11:31,168 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 111 [2018-12-02 17:11:31,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 114 [2018-12-02 17:11:31,393 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 118 [2018-12-02 17:11:31,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 157 [2018-12-02 17:11:31,607 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 171 [2018-12-02 17:11:31,682 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 17:11:31,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:11:31,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 98 [2018-12-02 17:11:31,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:31,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 101 [2018-12-02 17:11:31,983 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:31,990 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 142 [2018-12-02 17:11:32,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 177 [2018-12-02 17:11:32,195 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 180 [2018-12-02 17:11:32,245 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,285 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:32,467 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:32,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-12-02 17:11:32,470 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:32,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 98 [2018-12-02 17:11:32,473 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,482 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 92 [2018-12-02 17:11:32,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-02 17:11:32,621 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,630 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 94 [2018-12-02 17:11:32,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-02 17:11:32,636 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,646 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-12-02 17:11:32,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,651 INFO L478 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 48 treesize of output 44 [2018-12-02 17:11:32,652 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,662 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-12-02 17:11:32,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,755 INFO L478 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 50 treesize of output 46 [2018-12-02 17:11:32,756 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,763 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-12-02 17:11:32,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:11:32,768 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,775 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-12-02 17:11:32,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 17:11:32,781 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,789 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2018-12-02 17:11:32,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-02 17:11:32,858 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,866 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-12-02 17:11:32,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:32,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-02 17:11:32,928 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,934 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:32,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 17:11:32,974 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 12 variables, input treesize:483, output treesize:344 [2018-12-02 17:11:33,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-12-02 17:11:33,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2018-12-02 17:11:33,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-12-02 17:11:33,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2018-12-02 17:11:33,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 17:11:33,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-02 17:11:33,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 17:11:33,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-02 17:11:33,197 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 17:11:33,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 17:11:33,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 35 [2018-12-02 17:11:33,238 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,252 INFO L478 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 35 treesize of output 29 [2018-12-02 17:11:33,252 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-12-02 17:11:33,267 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,276 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:33,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 17:11:33,323 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:387, output treesize:148 [2018-12-02 17:11:33,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-12-02 17:11:33,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:11:33,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-12-02 17:11:33,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 17:11:33,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-02 17:11:33,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,446 INFO L478 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 25 treesize of output 19 [2018-12-02 17:11:33,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,449 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-12-02 17:11:33,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:33,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 17:11:33,464 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:33,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:33,477 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-02 17:11:33,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:33,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:34,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 267 [2018-12-02 17:11:34,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 235 [2018-12-02 17:11:34,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:34,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:35,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:35,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:36,133 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:36,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:36,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 184 [2018-12-02 17:11:36,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:11:36,829 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:36,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 64 [2018-12-02 17:11:36,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2018-12-02 17:11:36,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:36,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:36,899 INFO L478 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 18 treesize of output 37 [2018-12-02 17:11:36,899 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:36,914 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:36,950 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:36,978 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 170 [2018-12-02 17:11:37,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 123 [2018-12-02 17:11:37,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 135 [2018-12-02 17:11:37,464 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,474 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,492 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 228 [2018-12-02 17:11:37,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:11:37,846 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-12-02 17:11:37,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 17:11:37,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:37,930 INFO L478 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 18 treesize of output 37 [2018-12-02 17:11:37,930 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,944 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:37,963 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:38,008 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:38,216 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:38,272 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:38,511 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:38,547 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:38,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 153 [2018-12-02 17:11:38,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143 [2018-12-02 17:11:38,753 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:38,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:38,926 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 159 [2018-12-02 17:11:38,927 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 109 [2018-12-02 17:11:39,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 95 [2018-12-02 17:11:39,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 178 [2018-12-02 17:11:39,105 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,119 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,132 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 147 [2018-12-02 17:11:39,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 158 [2018-12-02 17:11:39,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 151 [2018-12-02 17:11:39,275 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,294 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 130 [2018-12-02 17:11:39,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 112 [2018-12-02 17:11:39,343 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,359 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,377 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,413 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 186 [2018-12-02 17:11:39,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 17:11:39,510 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-12-02 17:11:39,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 115 [2018-12-02 17:11:39,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 125 [2018-12-02 17:11:39,558 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,569 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,579 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,600 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 164 [2018-12-02 17:11:39,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 17:11:39,660 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,675 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,714 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:39,727 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:39,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 98 [2018-12-02 17:11:39,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,766 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-12-02 17:11:39,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:39,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-12-02 17:11:39,774 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,781 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,790 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:39,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:39,817 INFO L202 ElimStorePlain]: Needed 49 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-02 17:11:39,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2018-12-02 17:11:39,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-02 17:11:39,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:39,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:39,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2018-12-02 17:11:39,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-12-02 17:11:39,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:39,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2018-12-02 17:11:40,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 106 [2018-12-02 17:11:40,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 91 [2018-12-02 17:11:40,064 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:40,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 17:11:40,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2018-12-02 17:11:40,120 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,127 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-12-02 17:11:40,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-02 17:11:40,159 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,167 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-12-02 17:11:40,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 17:11:40,201 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,209 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 17:11:40,232 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:171, output treesize:140 [2018-12-02 17:11:40,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-12-02 17:11:40,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-02 17:11:40,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,310 INFO L478 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 16 treesize of output 8 [2018-12-02 17:11:40,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-02 17:11:40,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:40,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 17:11:40,332 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,346 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:91, output treesize:3 [2018-12-02 17:11:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 678 proven. 73 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 17:11:40,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:11:40,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,814 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,850 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,857 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,899 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,906 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:40,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 127 [2018-12-02 17:11:40,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-12-02 17:11:40,959 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:40,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:40,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 152 [2018-12-02 17:11:41,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 1 [2018-12-02 17:11:41,002 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-12-02 17:11:41,013 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,016 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 17:11:41,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 125 [2018-12-02 17:11:41,023 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,024 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,025 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 101 [2018-12-02 17:11:41,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,067 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,068 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,070 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 17:11:41,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 156 [2018-12-02 17:11:41,071 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,082 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,090 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,100 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 17:11:41,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 17:11:41,111 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:322, output treesize:192 [2018-12-02 17:11:41,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:177, output treesize:247 [2018-12-02 17:11:41,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:199, output treesize:269 [2018-12-02 17:11:41,406 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 17:11:41,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 17:11:41,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:535, output treesize:1 [2018-12-02 17:11:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 682 proven. 69 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 17:11:41,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:11:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 30 [2018-12-02 17:11:41,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:11:41,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 17:11:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 17:11:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-12-02 17:11:41,560 INFO L87 Difference]: Start difference. First operand 7146 states and 11310 transitions. Second operand 21 states. [2018-12-02 17:11:50,114 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2018-12-02 17:11:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:11:55,328 INFO L93 Difference]: Finished difference Result 23721 states and 37049 transitions. [2018-12-02 17:11:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 17:11:55,329 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 295 [2018-12-02 17:11:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:11:55,341 INFO L225 Difference]: With dead ends: 23721 [2018-12-02 17:11:55,341 INFO L226 Difference]: Without dead ends: 16602 [2018-12-02 17:11:55,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 570 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=616, Invalid=2576, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 17:11:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16602 states. [2018-12-02 17:11:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16602 to 11273. [2018-12-02 17:11:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11273 states. [2018-12-02 17:11:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 18101 transitions. [2018-12-02 17:11:56,186 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 18101 transitions. Word has length 295 [2018-12-02 17:11:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:11:56,187 INFO L480 AbstractCegarLoop]: Abstraction has 11273 states and 18101 transitions. [2018-12-02 17:11:56,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 17:11:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 18101 transitions. [2018-12-02 17:11:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-02 17:11:56,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:11:56,189 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:11:56,190 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:11:56,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:11:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1445744256, now seen corresponding path program 1 times [2018-12-02 17:11:56,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:11:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:56,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:11:56,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:11:56,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:11:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:11:56,442 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 17:11:56,491 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-02 17:11:56,491 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-02 17:11:56,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:11:56 BoogieIcfgContainer [2018-12-02 17:11:56,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:11:56,555 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:11:56,555 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:11:56,555 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:11:56,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:09:15" (3/4) ... [2018-12-02 17:11:56,558 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 17:11:56,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:11:56,558 INFO L168 Benchmark]: Toolchain (without parser) took 161665.64 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 946.9 MB in the beginning and 1.6 GB in the end (delta: -702.8 MB). Peak memory consumption was 487.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: RCFGBuilder took 634.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: TraceAbstraction took 160610.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 999.8 MB in the beginning and 1.6 GB in the end (delta: -649.8 MB). Peak memory consumption was 428.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:56,559 INFO L168 Benchmark]: Witness Printer took 3.01 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:56,560 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 634.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160610.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 999.8 MB in the beginning and 1.6 GB in the end (delta: -649.8 MB). Peak memory consumption was 428.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.01 ms. Allocated memory is still 2.2 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1735]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1434. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967352, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4294967309:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={4294967330:0}, malloc(sizeof(SSL_CTX))={4294967353:0}, malloc(sizeof(SSL_SESSION))={4294967299:0}, malloc(sizeof(struct ssl3_state_st))={4294967347:0}, s={4294967330:0}, SSLv3_server_data={4294967309:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={4294967330:0}, SSLv3_server_data={4294967309:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->info_callback={5:-4}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={5:-4}, blastFlag=1, got_new_session=0, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->hit=0, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8512, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1371] s->state = 8528 [L1372] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->options=4294967338, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp VAL [={5:-4}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] s->state = 8544 [L1419] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->verify_mode=4294967296, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer VAL [={5:-4}, (s->session)->peer={1:4294967295}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->session={4294967299:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8544, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND TRUE s->state == 8576 [L1492] ret = __VERIFIER_nondet_int() [L1493] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1498] COND FALSE !(ret == 2) [L1501] ret = __VERIFIER_nondet_int() [L1502] COND FALSE !(ret <= 0) [L1507] s->init_num = 0 [L1508] s->state = 8592 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND TRUE s->state == 8592 [L1513] ret = __VERIFIER_nondet_int() [L1514] COND FALSE !(ret <= 0) [L1519] s->state = 8608 [L1520] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND TRUE s->state == 8608 [L1524] ret = __VERIFIER_nondet_int() [L1525] COND FALSE !(ret <= 0) [L1530] s->state = 8640 [L1531] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] EXPR s->s3 [L1694] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1694] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1723] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1539] COND FALSE !(blastFlag == 7) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1542] COND FALSE !(blastFlag == 10) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1735] __VERIFIER_error() VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 162 locations, 1 error locations. UNSAFE Result, 160.5s OverallTime, 151 OverallIterations, 12 TraceHistogramMax, 83.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34689 SDtfs, 19817 SDslu, 67276 SDs, 0 SdLazy, 49603 SolverSat, 3834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5526 GetRequests, 4580 SyntacticMatches, 265 SemanticMatches, 681 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2492 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11273occurred in iteration=150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.7s AutomataMinimizationTime, 150 MinimizatonAttempts, 34495 StatesRemovedByMinimization, 147 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 12.4s SatisfiabilityAnalysisTime, 44.4s InterpolantComputationTime, 25639 NumberOfCodeBlocks, 25461 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 27377 ConstructedInterpolants, 260 QuantifiedInterpolants, 34365790 SizeOfPredicates, 88 NumberOfNonLiveVariables, 8446 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 168 InterpolantComputations, 149 PerfectInterpolantSequences, 43756/46008 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 17:11:58,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:11:58,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:11:58,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:11:58,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:11:58,895 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:11:58,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:11:58,897 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:11:58,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:11:58,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:11:58,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:11:58,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:11:58,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:11:58,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:11:58,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:11:58,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:11:58,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:11:58,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:11:58,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:11:58,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:11:58,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:11:58,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:11:58,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:11:58,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:11:58,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:11:58,911 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:11:58,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:11:58,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:11:58,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:11:58,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:11:58,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:11:58,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:11:58,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:11:58,914 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:11:58,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:11:58,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:11:58,916 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 17:11:58,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:11:58,926 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:11:58,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:11:58,927 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:11:58,927 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:11:58,927 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:11:58,927 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:11:58,927 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:11:58,928 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:11:58,928 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:11:58,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:11:58,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:11:58,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:11:58,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:11:58,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:11:58,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:11:58,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 17:11:58,931 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 00e4f55488ef7cc05fee246c4257b6c9346382d0 [2018-12-02 17:11:58,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:11:58,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:11:58,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:11:58,958 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:11:58,959 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:11:58,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-12-02 17:11:58,993 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/f53b83c05/31c6be275a924c008df135c0f7a40a23/FLAG570ac652a [2018-12-02 17:11:59,442 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:11:59,443 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/sv-benchmarks/c/ssh/s3_srvr.blast.15_false-unreach-call.i.cil.c [2018-12-02 17:11:59,453 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/f53b83c05/31c6be275a924c008df135c0f7a40a23/FLAG570ac652a [2018-12-02 17:11:59,461 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_491191b9-9843-463d-9564-5504800d6798/bin-2019/utaipan/data/f53b83c05/31c6be275a924c008df135c0f7a40a23 [2018-12-02 17:11:59,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:11:59,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:11:59,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:11:59,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:11:59,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:11:59,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:59" (1/1) ... [2018-12-02 17:11:59,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3103db51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:11:59, skipping insertion in model container [2018-12-02 17:11:59,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:11:59" (1/1) ... [2018-12-02 17:11:59,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:11:59,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:11:59,743 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:59,755 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:11:59,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:11:59,871 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 17:11:59,873 INFO L168 Benchmark]: Toolchain (without parser) took 409.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:59,874 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:11:59,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2018-12-02 17:11:59,875 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...