./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_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_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b ...................................................................................................................................................................... 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-09 03:05:36,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:05:36,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:05:36,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:05:36,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:05:36,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:05:36,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:05:36,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:05:36,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:05:36,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:05:36,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:05:36,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:05:36,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:05:36,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:05:36,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:05:36,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:05:36,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:05:36,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:05:36,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:05:36,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:05:36,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:05:36,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:05:36,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:05:36,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:05:36,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:05:36,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:05:36,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:05:36,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:05:36,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:05:36,467 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:05:36,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:05:36,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:05:36,468 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:05:36,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:05:36,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:05:36,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:05:36,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 03:05:36,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:05:36,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:05:36,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:05:36,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:05:36,481 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:05:36,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 03:05:36,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 03:05:36,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:05:36,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:05:36,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:05:36,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:05:36,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:05:36,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:05:36,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 03:05:36,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:05:36,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 03:05:36,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 03:05:36,485 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_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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 -> 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b [2018-12-09 03:05:36,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:05:36,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:05:36,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:05:36,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:05:36,516 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:05:36,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-09 03:05:36,551 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/13fd9d06e/ba2873de642f4092ab02d4b7f7d9a334/FLAG4c9fceca9 [2018-12-09 03:05:37,050 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:05:37,050 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-09 03:05:37,058 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/13fd9d06e/ba2873de642f4092ab02d4b7f7d9a334/FLAG4c9fceca9 [2018-12-09 03:05:37,066 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/13fd9d06e/ba2873de642f4092ab02d4b7f7d9a334 [2018-12-09 03:05:37,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:05:37,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:05:37,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:05:37,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:05:37,071 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:05:37,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fde7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37, skipping insertion in model container [2018-12-09 03:05:37,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:05:37,108 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:05:37,353 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:05:37,364 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:05:37,443 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:05:37,460 INFO L195 MainTranslator]: Completed translation [2018-12-09 03:05:37,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37 WrapperNode [2018-12-09 03:05:37,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 03:05:37,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 03:05:37,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 03:05:37,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 03:05:37,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 03:05:37,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 03:05:37,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 03:05:37,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 03:05:37,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... [2018-12-09 03:05:37,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 03:05:37,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 03:05:37,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 03:05:37,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 03:05:37,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 03:05:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 03:05:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 03:05:37,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 03:05:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 03:05:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 03:05:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 03:05:37,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 03:05:37,742 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 03:05:37,742 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 03:05:38,094 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 03:05:38,094 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 03:05:38,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:38 BoogieIcfgContainer [2018-12-09 03:05:38,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 03:05:38,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 03:05:38,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 03:05:38,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 03:05:38,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:05:37" (1/3) ... [2018-12-09 03:05:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeeec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:05:38, skipping insertion in model container [2018-12-09 03:05:38,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:05:37" (2/3) ... [2018-12-09 03:05:38,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eeeec21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:05:38, skipping insertion in model container [2018-12-09 03:05:38,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:38" (3/3) ... [2018-12-09 03:05:38,101 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-09 03:05:38,107 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 03:05:38,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 03:05:38,120 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 03:05:38,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 03:05:38,138 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 03:05:38,138 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 03:05:38,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 03:05:38,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 03:05:38,138 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 03:05:38,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 03:05:38,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 03:05:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-12-09 03:05:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 03:05:38,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:38,155 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] [2018-12-09 03:05:38,157 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:38,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1806902516, now seen corresponding path program 1 times [2018-12-09 03:05:38,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:38,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:38,343 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-09 03:05:38,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:38,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:38,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:38,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:38,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:38,358 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2018-12-09 03:05:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:38,628 INFO L93 Difference]: Finished difference Result 327 states and 546 transitions. [2018-12-09 03:05:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:38,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 03:05:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:38,636 INFO L225 Difference]: With dead ends: 327 [2018-12-09 03:05:38,636 INFO L226 Difference]: Without dead ends: 166 [2018-12-09 03:05:38,639 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-09 03:05:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-09 03:05:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2018-12-09 03:05:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-09 03:05:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2018-12-09 03:05:38,667 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 47 [2018-12-09 03:05:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:38,667 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2018-12-09 03:05:38,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2018-12-09 03:05:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 03:05:38,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:38,669 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] [2018-12-09 03:05:38,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:38,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash 719533870, now seen corresponding path program 1 times [2018-12-09 03:05:38,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:38,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:38,745 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-09 03:05:38,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:38,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:38,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:38,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:38,747 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2018-12-09 03:05:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:38,923 INFO L93 Difference]: Finished difference Result 290 states and 437 transitions. [2018-12-09 03:05:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:38,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 03:05:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:38,924 INFO L225 Difference]: With dead ends: 290 [2018-12-09 03:05:38,925 INFO L226 Difference]: Without dead ends: 166 [2018-12-09 03:05:38,925 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-09 03:05:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-09 03:05:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2018-12-09 03:05:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-09 03:05:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2018-12-09 03:05:38,931 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 60 [2018-12-09 03:05:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:38,931 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2018-12-09 03:05:38,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2018-12-09 03:05:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 03:05:38,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:38,933 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] [2018-12-09 03:05:38,933 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:38,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash 246730250, now seen corresponding path program 1 times [2018-12-09 03:05:38,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:38,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:39,018 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-09 03:05:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:39,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:05:39,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:39,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:05:39,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:05:39,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:05:39,019 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 5 states. [2018-12-09 03:05:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:39,299 INFO L93 Difference]: Finished difference Result 294 states and 445 transitions. [2018-12-09 03:05:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:05:39,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-09 03:05:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:39,301 INFO L225 Difference]: With dead ends: 294 [2018-12-09 03:05:39,301 INFO L226 Difference]: Without dead ends: 170 [2018-12-09 03:05:39,301 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-09 03:05:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-09 03:05:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-09 03:05:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 03:05:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2018-12-09 03:05:39,308 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 61 [2018-12-09 03:05:39,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:39,308 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2018-12-09 03:05:39,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:05:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2018-12-09 03:05:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 03:05:39,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:39,309 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] [2018-12-09 03:05:39,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:39,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:39,310 INFO L82 PathProgramCache]: Analyzing trace with hash -359930047, now seen corresponding path program 1 times [2018-12-09 03:05:39,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:39,357 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-09 03:05:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:39,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:39,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:39,358 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 4 states. [2018-12-09 03:05:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:39,529 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2018-12-09 03:05:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:39,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 03:05:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:39,531 INFO L225 Difference]: With dead ends: 327 [2018-12-09 03:05:39,531 INFO L226 Difference]: Without dead ends: 183 [2018-12-09 03:05:39,531 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-09 03:05:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-09 03:05:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2018-12-09 03:05:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 03:05:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2018-12-09 03:05:39,537 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 61 [2018-12-09 03:05:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:39,537 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2018-12-09 03:05:39,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2018-12-09 03:05:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 03:05:39,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:39,538 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] [2018-12-09 03:05:39,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:39,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2017958462, now seen corresponding path program 1 times [2018-12-09 03:05:39,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:39,572 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-09 03:05:39,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:39,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:39,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:39,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:39,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:39,573 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 4 states. [2018-12-09 03:05:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:39,715 INFO L93 Difference]: Finished difference Result 326 states and 483 transitions. [2018-12-09 03:05:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:39,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 03:05:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:39,716 INFO L225 Difference]: With dead ends: 326 [2018-12-09 03:05:39,716 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 03:05:39,716 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-09 03:05:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 03:05:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-09 03:05:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 03:05:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2018-12-09 03:05:39,721 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 61 [2018-12-09 03:05:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:39,721 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2018-12-09 03:05:39,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2018-12-09 03:05:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 03:05:39,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:39,722 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] [2018-12-09 03:05:39,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:39,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:39,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1592094827, now seen corresponding path program 1 times [2018-12-09 03:05:39,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:39,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:39,755 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-09 03:05:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:39,756 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:39,756 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 4 states. [2018-12-09 03:05:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:39,898 INFO L93 Difference]: Finished difference Result 326 states and 482 transitions. [2018-12-09 03:05:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:39,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 03:05:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:39,899 INFO L225 Difference]: With dead ends: 326 [2018-12-09 03:05:39,899 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 03:05:39,900 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-09 03:05:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 03:05:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-09 03:05:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 03:05:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2018-12-09 03:05:39,904 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 62 [2018-12-09 03:05:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:39,904 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2018-12-09 03:05:39,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2018-12-09 03:05:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 03:05:39,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:39,905 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] [2018-12-09 03:05:39,905 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:39,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1679775998, now seen corresponding path program 1 times [2018-12-09 03:05:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:39,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:39,950 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-09 03:05:39,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:39,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:39,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:39,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:39,951 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand 4 states. [2018-12-09 03:05:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:40,097 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2018-12-09 03:05:40,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:40,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 03:05:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:40,098 INFO L225 Difference]: With dead ends: 326 [2018-12-09 03:05:40,098 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 03:05:40,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-09 03:05:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 03:05:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 169. [2018-12-09 03:05:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 03:05:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2018-12-09 03:05:40,102 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 63 [2018-12-09 03:05:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:40,103 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2018-12-09 03:05:40,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2018-12-09 03:05:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 03:05:40,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:40,104 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] [2018-12-09 03:05:40,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:40,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:40,104 INFO L82 PathProgramCache]: Analyzing trace with hash 939026693, now seen corresponding path program 1 times [2018-12-09 03:05:40,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:40,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:40,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:40,144 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-09 03:05:40,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:40,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:40,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:40,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:40,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:40,145 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand 4 states. [2018-12-09 03:05:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:40,312 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2018-12-09 03:05:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:40,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 03:05:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:40,313 INFO L225 Difference]: With dead ends: 355 [2018-12-09 03:05:40,314 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 03:05:40,314 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-09 03:05:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 03:05:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-12-09 03:05:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2018-12-09 03:05:40,318 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 64 [2018-12-09 03:05:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:40,318 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2018-12-09 03:05:40,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2018-12-09 03:05:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 03:05:40,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:40,319 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] [2018-12-09 03:05:40,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:40,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1518844186, now seen corresponding path program 1 times [2018-12-09 03:05:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:40,352 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-09 03:05:40,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:40,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:40,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:40,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:40,353 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand 4 states. [2018-12-09 03:05:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:40,495 INFO L93 Difference]: Finished difference Result 370 states and 554 transitions. [2018-12-09 03:05:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:40,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 03:05:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:40,497 INFO L225 Difference]: With dead ends: 370 [2018-12-09 03:05:40,497 INFO L226 Difference]: Without dead ends: 204 [2018-12-09 03:05:40,497 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-09 03:05:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-09 03:05:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2018-12-09 03:05:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 283 transitions. [2018-12-09 03:05:40,501 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 283 transitions. Word has length 64 [2018-12-09 03:05:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:40,501 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 283 transitions. [2018-12-09 03:05:40,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 283 transitions. [2018-12-09 03:05:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 03:05:40,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:40,501 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] [2018-12-09 03:05:40,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:40,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash 781376025, now seen corresponding path program 1 times [2018-12-09 03:05:40,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:40,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:40,530 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-09 03:05:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:40,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:40,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:40,531 INFO L87 Difference]: Start difference. First operand 191 states and 283 transitions. Second operand 4 states. [2018-12-09 03:05:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:40,653 INFO L93 Difference]: Finished difference Result 360 states and 541 transitions. [2018-12-09 03:05:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:40,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 03:05:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:40,654 INFO L225 Difference]: With dead ends: 360 [2018-12-09 03:05:40,654 INFO L226 Difference]: Without dead ends: 194 [2018-12-09 03:05:40,654 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-09 03:05:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-09 03:05:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-12-09 03:05:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2018-12-09 03:05:40,659 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 65 [2018-12-09 03:05:40,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:40,659 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2018-12-09 03:05:40,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2018-12-09 03:05:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 03:05:40,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:40,660 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] [2018-12-09 03:05:40,660 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:40,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:40,661 INFO L82 PathProgramCache]: Analyzing trace with hash -304224811, now seen corresponding path program 1 times [2018-12-09 03:05:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:40,706 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-09 03:05:40,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:40,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:40,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:40,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:40,708 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand 4 states. [2018-12-09 03:05:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:40,889 INFO L93 Difference]: Finished difference Result 377 states and 561 transitions. [2018-12-09 03:05:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:40,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-09 03:05:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:40,890 INFO L225 Difference]: With dead ends: 377 [2018-12-09 03:05:40,891 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 03:05:40,891 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-09 03:05:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 03:05:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-12-09 03:05:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2018-12-09 03:05:40,896 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 77 [2018-12-09 03:05:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:40,896 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2018-12-09 03:05:40,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2018-12-09 03:05:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 03:05:40,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:40,897 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] [2018-12-09 03:05:40,897 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:40,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2031678086, now seen corresponding path program 1 times [2018-12-09 03:05:40,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:40,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:40,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:40,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:40,934 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-09 03:05:40,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:40,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:40,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:40,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:40,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:40,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:40,936 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand 4 states. [2018-12-09 03:05:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:41,123 INFO L93 Difference]: Finished difference Result 375 states and 557 transitions. [2018-12-09 03:05:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:41,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 03:05:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:41,125 INFO L225 Difference]: With dead ends: 375 [2018-12-09 03:05:41,125 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 03:05:41,125 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-09 03:05:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 03:05:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2018-12-09 03:05:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2018-12-09 03:05:41,131 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 78 [2018-12-09 03:05:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:41,131 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2018-12-09 03:05:41,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2018-12-09 03:05:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 03:05:41,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:41,132 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] [2018-12-09 03:05:41,132 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:41,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash 605260795, now seen corresponding path program 1 times [2018-12-09 03:05:41,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:41,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:41,168 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-09 03:05:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:41,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:41,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:41,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:41,169 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand 4 states. [2018-12-09 03:05:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:41,341 INFO L93 Difference]: Finished difference Result 374 states and 554 transitions. [2018-12-09 03:05:41,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:41,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 03:05:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:41,342 INFO L225 Difference]: With dead ends: 374 [2018-12-09 03:05:41,342 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 03:05:41,343 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-09 03:05:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 03:05:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-09 03:05:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2018-12-09 03:05:41,349 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 78 [2018-12-09 03:05:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:41,349 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2018-12-09 03:05:41,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2018-12-09 03:05:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 03:05:41,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:41,350 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] [2018-12-09 03:05:41,350 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:41,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:41,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1307513170, now seen corresponding path program 1 times [2018-12-09 03:05:41,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:41,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:41,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:41,398 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-09 03:05:41,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:41,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:41,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:41,399 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand 4 states. [2018-12-09 03:05:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:41,570 INFO L93 Difference]: Finished difference Result 374 states and 552 transitions. [2018-12-09 03:05:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:41,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 03:05:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:41,571 INFO L225 Difference]: With dead ends: 374 [2018-12-09 03:05:41,571 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 03:05:41,571 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-09 03:05:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 03:05:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-09 03:05:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2018-12-09 03:05:41,577 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 79 [2018-12-09 03:05:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:41,577 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2018-12-09 03:05:41,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2018-12-09 03:05:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 03:05:41,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:41,578 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] [2018-12-09 03:05:41,579 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:41,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1447679223, now seen corresponding path program 1 times [2018-12-09 03:05:41,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:41,640 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-09 03:05:41,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:41,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:41,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:41,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:41,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:41,641 INFO L87 Difference]: Start difference. First operand 191 states and 278 transitions. Second operand 4 states. [2018-12-09 03:05:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:41,810 INFO L93 Difference]: Finished difference Result 374 states and 550 transitions. [2018-12-09 03:05:41,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:41,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 03:05:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:41,811 INFO L225 Difference]: With dead ends: 374 [2018-12-09 03:05:41,811 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 03:05:41,811 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-09 03:05:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 03:05:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-09 03:05:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2018-12-09 03:05:41,815 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 80 [2018-12-09 03:05:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:41,815 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2018-12-09 03:05:41,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2018-12-09 03:05:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 03:05:41,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:41,815 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] [2018-12-09 03:05:41,816 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:41,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -123909619, now seen corresponding path program 1 times [2018-12-09 03:05:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:41,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:41,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:41,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:41,842 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-09 03:05:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:41,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:41,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:41,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:41,843 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand 4 states. [2018-12-09 03:05:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:42,006 INFO L93 Difference]: Finished difference Result 374 states and 548 transitions. [2018-12-09 03:05:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:42,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 03:05:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:42,007 INFO L225 Difference]: With dead ends: 374 [2018-12-09 03:05:42,007 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 03:05:42,007 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-09 03:05:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 03:05:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2018-12-09 03:05:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2018-12-09 03:05:42,011 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 81 [2018-12-09 03:05:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:42,011 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2018-12-09 03:05:42,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2018-12-09 03:05:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 03:05:42,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:42,012 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] [2018-12-09 03:05:42,012 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:42,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1074674642, now seen corresponding path program 1 times [2018-12-09 03:05:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:42,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:42,055 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-09 03:05:42,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:42,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:42,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:42,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:42,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:42,056 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 4 states. [2018-12-09 03:05:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:42,251 INFO L93 Difference]: Finished difference Result 364 states and 534 transitions. [2018-12-09 03:05:42,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:42,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 03:05:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:42,252 INFO L225 Difference]: With dead ends: 364 [2018-12-09 03:05:42,252 INFO L226 Difference]: Without dead ends: 198 [2018-12-09 03:05:42,252 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-09 03:05:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-09 03:05:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-12-09 03:05:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-09 03:05:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2018-12-09 03:05:42,257 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 82 [2018-12-09 03:05:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:42,258 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2018-12-09 03:05:42,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2018-12-09 03:05:42,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 03:05:42,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:42,258 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] [2018-12-09 03:05:42,259 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:42,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1603097898, now seen corresponding path program 1 times [2018-12-09 03:05:42,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:42,319 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-09 03:05:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:42,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:42,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:42,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:42,320 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand 4 states. [2018-12-09 03:05:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:42,572 INFO L93 Difference]: Finished difference Result 461 states and 680 transitions. [2018-12-09 03:05:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:42,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 03:05:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:42,573 INFO L225 Difference]: With dead ends: 461 [2018-12-09 03:05:42,573 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 03:05:42,574 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-09 03:05:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 03:05:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 232. [2018-12-09 03:05:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 03:05:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2018-12-09 03:05:42,579 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 86 [2018-12-09 03:05:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:42,579 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2018-12-09 03:05:42,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2018-12-09 03:05:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 03:05:42,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:42,580 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] [2018-12-09 03:05:42,580 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:42,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -242269268, now seen corresponding path program 1 times [2018-12-09 03:05:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:42,614 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-09 03:05:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:42,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:42,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:42,615 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2018-12-09 03:05:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:42,805 INFO L93 Difference]: Finished difference Result 487 states and 740 transitions. [2018-12-09 03:05:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:42,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 03:05:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:42,806 INFO L225 Difference]: With dead ends: 487 [2018-12-09 03:05:42,806 INFO L226 Difference]: Without dead ends: 280 [2018-12-09 03:05:42,807 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-09 03:05:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-09 03:05:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-09 03:05:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 03:05:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2018-12-09 03:05:42,813 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 86 [2018-12-09 03:05:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:42,813 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2018-12-09 03:05:42,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2018-12-09 03:05:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 03:05:42,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:42,814 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] [2018-12-09 03:05:42,814 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:42,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1850075530, now seen corresponding path program 1 times [2018-12-09 03:05:42,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:42,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:42,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:42,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:42,869 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-09 03:05:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:42,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:42,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:42,870 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2018-12-09 03:05:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:43,078 INFO L93 Difference]: Finished difference Result 544 states and 827 transitions. [2018-12-09 03:05:43,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:43,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-09 03:05:43,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:43,079 INFO L225 Difference]: With dead ends: 544 [2018-12-09 03:05:43,079 INFO L226 Difference]: Without dead ends: 313 [2018-12-09 03:05:43,079 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-09 03:05:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-09 03:05:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2018-12-09 03:05:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2018-12-09 03:05:43,086 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 87 [2018-12-09 03:05:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:43,086 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2018-12-09 03:05:43,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2018-12-09 03:05:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 03:05:43,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:43,087 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] [2018-12-09 03:05:43,087 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:43,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash -776561200, now seen corresponding path program 1 times [2018-12-09 03:05:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:43,131 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-09 03:05:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:43,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:43,132 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2018-12-09 03:05:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:43,360 INFO L93 Difference]: Finished difference Result 545 states and 827 transitions. [2018-12-09 03:05:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:43,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-09 03:05:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:43,361 INFO L225 Difference]: With dead ends: 545 [2018-12-09 03:05:43,361 INFO L226 Difference]: Without dead ends: 313 [2018-12-09 03:05:43,361 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-09 03:05:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-09 03:05:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 257. [2018-12-09 03:05:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2018-12-09 03:05:43,367 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 99 [2018-12-09 03:05:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:43,367 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2018-12-09 03:05:43,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2018-12-09 03:05:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 03:05:43,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:43,367 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] [2018-12-09 03:05:43,368 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:43,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash 761778830, now seen corresponding path program 1 times [2018-12-09 03:05:43,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:43,404 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-09 03:05:43,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:43,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:43,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:43,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:43,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:43,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:43,406 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2018-12-09 03:05:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:43,567 INFO L93 Difference]: Finished difference Result 513 states and 780 transitions. [2018-12-09 03:05:43,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:43,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-09 03:05:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:43,568 INFO L225 Difference]: With dead ends: 513 [2018-12-09 03:05:43,568 INFO L226 Difference]: Without dead ends: 281 [2018-12-09 03:05:43,569 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-09 03:05:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-09 03:05:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 257. [2018-12-09 03:05:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2018-12-09 03:05:43,574 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 99 [2018-12-09 03:05:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:43,574 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2018-12-09 03:05:43,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2018-12-09 03:05:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 03:05:43,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:43,575 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] [2018-12-09 03:05:43,575 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:43,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 505763039, now seen corresponding path program 1 times [2018-12-09 03:05:43,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:43,624 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-09 03:05:43,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:43,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:43,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:43,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:43,625 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2018-12-09 03:05:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:43,831 INFO L93 Difference]: Finished difference Result 543 states and 821 transitions. [2018-12-09 03:05:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:43,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 03:05:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:43,832 INFO L225 Difference]: With dead ends: 543 [2018-12-09 03:05:43,832 INFO L226 Difference]: Without dead ends: 311 [2018-12-09 03:05:43,833 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-09 03:05:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-09 03:05:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 257. [2018-12-09 03:05:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2018-12-09 03:05:43,838 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 100 [2018-12-09 03:05:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:43,838 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2018-12-09 03:05:43,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2018-12-09 03:05:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 03:05:43,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:43,838 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] [2018-12-09 03:05:43,839 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:43,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1152265376, now seen corresponding path program 1 times [2018-12-09 03:05:43,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:43,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:43,876 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-09 03:05:43,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:43,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:43,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:43,877 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2018-12-09 03:05:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:44,077 INFO L93 Difference]: Finished difference Result 542 states and 818 transitions. [2018-12-09 03:05:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:44,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 03:05:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:44,078 INFO L225 Difference]: With dead ends: 542 [2018-12-09 03:05:44,078 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 03:05:44,079 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-09 03:05:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 03:05:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-09 03:05:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2018-12-09 03:05:44,084 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 100 [2018-12-09 03:05:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:44,084 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2018-12-09 03:05:44,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2018-12-09 03:05:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 03:05:44,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:44,085 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] [2018-12-09 03:05:44,085 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:44,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 949663713, now seen corresponding path program 1 times [2018-12-09 03:05:44,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:44,115 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-09 03:05:44,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:44,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:44,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:44,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:44,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:44,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:44,116 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2018-12-09 03:05:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:44,259 INFO L93 Difference]: Finished difference Result 511 states and 772 transitions. [2018-12-09 03:05:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:44,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 03:05:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:44,260 INFO L225 Difference]: With dead ends: 511 [2018-12-09 03:05:44,260 INFO L226 Difference]: Without dead ends: 279 [2018-12-09 03:05:44,261 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-09 03:05:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-09 03:05:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2018-12-09 03:05:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2018-12-09 03:05:44,267 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 100 [2018-12-09 03:05:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:44,267 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2018-12-09 03:05:44,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2018-12-09 03:05:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 03:05:44,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:44,268 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] [2018-12-09 03:05:44,268 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:44,269 INFO L82 PathProgramCache]: Analyzing trace with hash -708364702, now seen corresponding path program 1 times [2018-12-09 03:05:44,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:44,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:44,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:44,310 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-09 03:05:44,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:44,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:44,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:44,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:44,311 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2018-12-09 03:05:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:44,462 INFO L93 Difference]: Finished difference Result 510 states and 769 transitions. [2018-12-09 03:05:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:44,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 03:05:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:44,463 INFO L225 Difference]: With dead ends: 510 [2018-12-09 03:05:44,463 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 03:05:44,463 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-09 03:05:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 03:05:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-09 03:05:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2018-12-09 03:05:44,469 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 100 [2018-12-09 03:05:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:44,469 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2018-12-09 03:05:44,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2018-12-09 03:05:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 03:05:44,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:44,469 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] [2018-12-09 03:05:44,470 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:44,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:44,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1636190579, now seen corresponding path program 1 times [2018-12-09 03:05:44,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:44,494 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-09 03:05:44,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:44,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:44,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:44,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:44,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:44,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:44,495 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2018-12-09 03:05:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:44,692 INFO L93 Difference]: Finished difference Result 542 states and 812 transitions. [2018-12-09 03:05:44,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:44,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-09 03:05:44,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:44,693 INFO L225 Difference]: With dead ends: 542 [2018-12-09 03:05:44,693 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 03:05:44,693 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-09 03:05:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 03:05:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-09 03:05:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2018-12-09 03:05:44,699 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 101 [2018-12-09 03:05:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:44,699 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2018-12-09 03:05:44,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2018-12-09 03:05:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 03:05:44,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:44,699 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] [2018-12-09 03:05:44,700 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:44,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash -760171573, now seen corresponding path program 1 times [2018-12-09 03:05:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:44,742 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-09 03:05:44,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:44,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:44,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:44,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:44,743 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2018-12-09 03:05:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:44,914 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2018-12-09 03:05:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:44,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-09 03:05:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:44,915 INFO L225 Difference]: With dead ends: 510 [2018-12-09 03:05:44,915 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 03:05:44,915 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-09 03:05:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 03:05:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-09 03:05:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2018-12-09 03:05:44,921 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 101 [2018-12-09 03:05:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:44,921 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2018-12-09 03:05:44,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2018-12-09 03:05:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 03:05:44,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:44,921 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] [2018-12-09 03:05:44,922 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:44,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 387176220, now seen corresponding path program 1 times [2018-12-09 03:05:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:44,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:44,954 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-09 03:05:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:44,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:44,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:44,955 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2018-12-09 03:05:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:45,166 INFO L93 Difference]: Finished difference Result 542 states and 808 transitions. [2018-12-09 03:05:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:45,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 03:05:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:45,167 INFO L225 Difference]: With dead ends: 542 [2018-12-09 03:05:45,167 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 03:05:45,168 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-09 03:05:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 03:05:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-09 03:05:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2018-12-09 03:05:45,174 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 102 [2018-12-09 03:05:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2018-12-09 03:05:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2018-12-09 03:05:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 03:05:45,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:45,175 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] [2018-12-09 03:05:45,175 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:45,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1773961630, now seen corresponding path program 1 times [2018-12-09 03:05:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:45,212 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-09 03:05:45,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:45,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:45,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:45,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:45,213 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2018-12-09 03:05:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:45,380 INFO L93 Difference]: Finished difference Result 510 states and 761 transitions. [2018-12-09 03:05:45,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:45,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 03:05:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:45,381 INFO L225 Difference]: With dead ends: 510 [2018-12-09 03:05:45,382 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 03:05:45,382 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-09 03:05:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 03:05:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-09 03:05:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 380 transitions. [2018-12-09 03:05:45,392 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 380 transitions. Word has length 102 [2018-12-09 03:05:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:45,393 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 380 transitions. [2018-12-09 03:05:45,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 380 transitions. [2018-12-09 03:05:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 03:05:45,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:45,394 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] [2018-12-09 03:05:45,394 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:45,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1360235656, now seen corresponding path program 1 times [2018-12-09 03:05:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:45,433 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-09 03:05:45,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:45,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:45,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:45,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:45,434 INFO L87 Difference]: Start difference. First operand 257 states and 380 transitions. Second operand 4 states. [2018-12-09 03:05:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:45,628 INFO L93 Difference]: Finished difference Result 542 states and 804 transitions. [2018-12-09 03:05:45,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:45,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 03:05:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:45,629 INFO L225 Difference]: With dead ends: 542 [2018-12-09 03:05:45,629 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 03:05:45,630 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-09 03:05:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 03:05:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 257. [2018-12-09 03:05:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 379 transitions. [2018-12-09 03:05:45,637 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 379 transitions. Word has length 103 [2018-12-09 03:05:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:45,637 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 379 transitions. [2018-12-09 03:05:45,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 379 transitions. [2018-12-09 03:05:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 03:05:45,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:45,638 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] [2018-12-09 03:05:45,638 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:45,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1400910406, now seen corresponding path program 1 times [2018-12-09 03:05:45,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:45,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:45,679 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-09 03:05:45,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:45,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:45,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:45,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:45,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:45,680 INFO L87 Difference]: Start difference. First operand 257 states and 379 transitions. Second operand 4 states. [2018-12-09 03:05:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:45,844 INFO L93 Difference]: Finished difference Result 510 states and 757 transitions. [2018-12-09 03:05:45,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:45,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 03:05:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:45,845 INFO L225 Difference]: With dead ends: 510 [2018-12-09 03:05:45,845 INFO L226 Difference]: Without dead ends: 278 [2018-12-09 03:05:45,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-09 03:05:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-09 03:05:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2018-12-09 03:05:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 378 transitions. [2018-12-09 03:05:45,854 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 378 transitions. Word has length 103 [2018-12-09 03:05:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:45,854 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 378 transitions. [2018-12-09 03:05:45,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 378 transitions. [2018-12-09 03:05:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:05:45,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:45,855 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] [2018-12-09 03:05:45,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:45,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -161462089, now seen corresponding path program 1 times [2018-12-09 03:05:45,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:45,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:45,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:45,899 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-09 03:05:45,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:45,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:45,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:45,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:45,900 INFO L87 Difference]: Start difference. First operand 257 states and 378 transitions. Second operand 4 states. [2018-12-09 03:05:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:46,119 INFO L93 Difference]: Finished difference Result 532 states and 788 transitions. [2018-12-09 03:05:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:46,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:05:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:46,120 INFO L225 Difference]: With dead ends: 532 [2018-12-09 03:05:46,120 INFO L226 Difference]: Without dead ends: 300 [2018-12-09 03:05:46,121 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-09 03:05:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-09 03:05:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2018-12-09 03:05:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2018-12-09 03:05:46,129 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 104 [2018-12-09 03:05:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:46,129 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2018-12-09 03:05:46,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2018-12-09 03:05:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 03:05:46,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:46,130 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] [2018-12-09 03:05:46,130 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:46,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1099455161, now seen corresponding path program 1 times [2018-12-09 03:05:46,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:46,192 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-09 03:05:46,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:46,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:46,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:46,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:46,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:46,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:46,193 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand 4 states. [2018-12-09 03:05:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:46,326 INFO L93 Difference]: Finished difference Result 500 states and 741 transitions. [2018-12-09 03:05:46,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:46,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-09 03:05:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:46,327 INFO L225 Difference]: With dead ends: 500 [2018-12-09 03:05:46,328 INFO L226 Difference]: Without dead ends: 268 [2018-12-09 03:05:46,328 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-09 03:05:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-09 03:05:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2018-12-09 03:05:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2018-12-09 03:05:46,334 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 104 [2018-12-09 03:05:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:46,334 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2018-12-09 03:05:46,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2018-12-09 03:05:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 03:05:46,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:46,335 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] [2018-12-09 03:05:46,335 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:46,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1423943715, now seen corresponding path program 1 times [2018-12-09 03:05:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:46,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:46,366 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-09 03:05:46,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:46,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:46,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:46,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:46,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:46,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:46,367 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand 4 states. [2018-12-09 03:05:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:46,580 INFO L93 Difference]: Finished difference Result 532 states and 784 transitions. [2018-12-09 03:05:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:46,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 03:05:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:46,581 INFO L225 Difference]: With dead ends: 532 [2018-12-09 03:05:46,581 INFO L226 Difference]: Without dead ends: 300 [2018-12-09 03:05:46,582 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-09 03:05:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-09 03:05:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2018-12-09 03:05:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-09 03:05:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 375 transitions. [2018-12-09 03:05:46,593 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 375 transitions. Word has length 108 [2018-12-09 03:05:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:46,594 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 375 transitions. [2018-12-09 03:05:46,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 375 transitions. [2018-12-09 03:05:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 03:05:46,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:46,595 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] [2018-12-09 03:05:46,595 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:46,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash -909448923, now seen corresponding path program 1 times [2018-12-09 03:05:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:46,636 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-09 03:05:46,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:46,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:46,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:46,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:46,636 INFO L87 Difference]: Start difference. First operand 257 states and 375 transitions. Second operand 4 states. [2018-12-09 03:05:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:46,798 INFO L93 Difference]: Finished difference Result 541 states and 801 transitions. [2018-12-09 03:05:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:46,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-09 03:05:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:46,799 INFO L225 Difference]: With dead ends: 541 [2018-12-09 03:05:46,799 INFO L226 Difference]: Without dead ends: 309 [2018-12-09 03:05:46,800 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-09 03:05:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-09 03:05:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-12-09 03:05:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2018-12-09 03:05:46,810 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 108 [2018-12-09 03:05:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:46,810 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2018-12-09 03:05:46,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2018-12-09 03:05:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 03:05:46,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:46,811 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] [2018-12-09 03:05:46,811 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:46,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -336160653, now seen corresponding path program 1 times [2018-12-09 03:05:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:46,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:46,850 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-09 03:05:46,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:46,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:46,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:46,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:46,851 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2018-12-09 03:05:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:47,077 INFO L93 Difference]: Finished difference Result 584 states and 872 transitions. [2018-12-09 03:05:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:47,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 03:05:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:47,079 INFO L225 Difference]: With dead ends: 584 [2018-12-09 03:05:47,079 INFO L226 Difference]: Without dead ends: 326 [2018-12-09 03:05:47,079 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-09 03:05:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-09 03:05:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 283. [2018-12-09 03:05:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2018-12-09 03:05:47,089 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2018-12-09 03:05:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:47,089 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2018-12-09 03:05:47,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2018-12-09 03:05:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 03:05:47,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:47,090 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] [2018-12-09 03:05:47,090 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:47,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:47,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1613279934, now seen corresponding path program 1 times [2018-12-09 03:05:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:47,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:47,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:47,142 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-09 03:05:47,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:47,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:47,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:47,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:47,143 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2018-12-09 03:05:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:47,330 INFO L93 Difference]: Finished difference Result 576 states and 857 transitions. [2018-12-09 03:05:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:47,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-09 03:05:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:47,331 INFO L225 Difference]: With dead ends: 576 [2018-12-09 03:05:47,331 INFO L226 Difference]: Without dead ends: 318 [2018-12-09 03:05:47,332 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-09 03:05:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-09 03:05:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-09 03:05:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2018-12-09 03:05:47,339 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 112 [2018-12-09 03:05:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2018-12-09 03:05:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2018-12-09 03:05:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 03:05:47,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:47,340 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] [2018-12-09 03:05:47,340 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash -983730547, now seen corresponding path program 1 times [2018-12-09 03:05:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:47,381 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-09 03:05:47,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:47,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:47,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:47,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:47,382 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2018-12-09 03:05:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:47,567 INFO L93 Difference]: Finished difference Result 576 states and 855 transitions. [2018-12-09 03:05:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:47,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 03:05:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:47,568 INFO L225 Difference]: With dead ends: 576 [2018-12-09 03:05:47,568 INFO L226 Difference]: Without dead ends: 318 [2018-12-09 03:05:47,569 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-09 03:05:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-09 03:05:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-09 03:05:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2018-12-09 03:05:47,577 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 113 [2018-12-09 03:05:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:47,577 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2018-12-09 03:05:47,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2018-12-09 03:05:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 03:05:47,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:47,577 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] [2018-12-09 03:05:47,577 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:47,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -305522056, now seen corresponding path program 1 times [2018-12-09 03:05:47,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:47,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:47,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:47,612 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-09 03:05:47,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:47,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:47,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:47,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:47,613 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2018-12-09 03:05:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:47,819 INFO L93 Difference]: Finished difference Result 576 states and 853 transitions. [2018-12-09 03:05:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-09 03:05:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:47,821 INFO L225 Difference]: With dead ends: 576 [2018-12-09 03:05:47,821 INFO L226 Difference]: Without dead ends: 318 [2018-12-09 03:05:47,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-09 03:05:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-09 03:05:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2018-12-09 03:05:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2018-12-09 03:05:47,832 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2018-12-09 03:05:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:47,833 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2018-12-09 03:05:47,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2018-12-09 03:05:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 03:05:47,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 03:05:47,834 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:47,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1989852924, now seen corresponding path program 1 times [2018-12-09 03:05:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:47,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:47,876 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-09 03:05:47,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:47,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:47,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:47,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:47,878 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2018-12-09 03:05:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:48,054 INFO L93 Difference]: Finished difference Result 574 states and 849 transitions. [2018-12-09 03:05:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:48,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-09 03:05:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:48,055 INFO L225 Difference]: With dead ends: 574 [2018-12-09 03:05:48,055 INFO L226 Difference]: Without dead ends: 316 [2018-12-09 03:05:48,056 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-09 03:05:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-09 03:05:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2018-12-09 03:05:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2018-12-09 03:05:48,065 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 114 [2018-12-09 03:05:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:48,065 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2018-12-09 03:05:48,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2018-12-09 03:05:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 03:05:48,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:48,066 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] [2018-12-09 03:05:48,066 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:48,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 568172779, now seen corresponding path program 1 times [2018-12-09 03:05:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:48,108 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-09 03:05:48,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:48,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:48,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:48,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:48,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:48,109 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2018-12-09 03:05:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:48,274 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2018-12-09 03:05:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:48,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-09 03:05:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:48,275 INFO L225 Difference]: With dead ends: 571 [2018-12-09 03:05:48,275 INFO L226 Difference]: Without dead ends: 313 [2018-12-09 03:05:48,276 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-09 03:05:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-09 03:05:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2018-12-09 03:05:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2018-12-09 03:05:48,283 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 115 [2018-12-09 03:05:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:48,284 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2018-12-09 03:05:48,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2018-12-09 03:05:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 03:05:48,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:48,284 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] [2018-12-09 03:05:48,284 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:48,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash 926271145, now seen corresponding path program 1 times [2018-12-09 03:05:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:48,318 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-09 03:05:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:48,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:48,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:48,319 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2018-12-09 03:05:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:48,485 INFO L93 Difference]: Finished difference Result 569 states and 838 transitions. [2018-12-09 03:05:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:48,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-09 03:05:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:48,486 INFO L225 Difference]: With dead ends: 569 [2018-12-09 03:05:48,487 INFO L226 Difference]: Without dead ends: 311 [2018-12-09 03:05:48,487 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-09 03:05:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-09 03:05:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2018-12-09 03:05:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2018-12-09 03:05:48,496 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 115 [2018-12-09 03:05:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:48,496 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2018-12-09 03:05:48,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2018-12-09 03:05:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 03:05:48,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:48,497 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] [2018-12-09 03:05:48,497 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:48,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1835524813, now seen corresponding path program 1 times [2018-12-09 03:05:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:48,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:48,531 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-09 03:05:48,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:48,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:48,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:48,532 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2018-12-09 03:05:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:48,694 INFO L93 Difference]: Finished difference Result 569 states and 836 transitions. [2018-12-09 03:05:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:48,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-09 03:05:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:48,695 INFO L225 Difference]: With dead ends: 569 [2018-12-09 03:05:48,695 INFO L226 Difference]: Without dead ends: 311 [2018-12-09 03:05:48,695 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-09 03:05:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-09 03:05:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2018-12-09 03:05:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 412 transitions. [2018-12-09 03:05:48,703 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 412 transitions. Word has length 117 [2018-12-09 03:05:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:48,703 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 412 transitions. [2018-12-09 03:05:48,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 412 transitions. [2018-12-09 03:05:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 03:05:48,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:48,704 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] [2018-12-09 03:05:48,704 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:48,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1824561631, now seen corresponding path program 1 times [2018-12-09 03:05:48,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:48,742 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-09 03:05:48,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:48,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:48,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:48,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:48,743 INFO L87 Difference]: Start difference. First operand 283 states and 412 transitions. Second operand 4 states. [2018-12-09 03:05:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:48,903 INFO L93 Difference]: Finished difference Result 565 states and 829 transitions. [2018-12-09 03:05:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:48,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-09 03:05:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:48,904 INFO L225 Difference]: With dead ends: 565 [2018-12-09 03:05:48,904 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 03:05:48,905 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-09 03:05:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 03:05:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2018-12-09 03:05:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 411 transitions. [2018-12-09 03:05:48,914 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 411 transitions. Word has length 118 [2018-12-09 03:05:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:48,914 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 411 transitions. [2018-12-09 03:05:48,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 411 transitions. [2018-12-09 03:05:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 03:05:48,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:48,915 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] [2018-12-09 03:05:48,915 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:48,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1368024590, now seen corresponding path program 1 times [2018-12-09 03:05:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:48,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:48,951 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-09 03:05:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:48,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:48,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:48,952 INFO L87 Difference]: Start difference. First operand 283 states and 411 transitions. Second operand 4 states. [2018-12-09 03:05:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:49,112 INFO L93 Difference]: Finished difference Result 565 states and 827 transitions. [2018-12-09 03:05:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:49,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-09 03:05:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:49,114 INFO L225 Difference]: With dead ends: 565 [2018-12-09 03:05:49,114 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 03:05:49,114 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-09 03:05:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 03:05:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2018-12-09 03:05:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 410 transitions. [2018-12-09 03:05:49,122 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 410 transitions. Word has length 118 [2018-12-09 03:05:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:49,122 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 410 transitions. [2018-12-09 03:05:49,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 410 transitions. [2018-12-09 03:05:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 03:05:49,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:49,123 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] [2018-12-09 03:05:49,123 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:49,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1236988802, now seen corresponding path program 1 times [2018-12-09 03:05:49,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:49,156 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-09 03:05:49,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:49,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:49,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:49,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:49,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:49,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:49,157 INFO L87 Difference]: Start difference. First operand 283 states and 410 transitions. Second operand 4 states. [2018-12-09 03:05:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:49,318 INFO L93 Difference]: Finished difference Result 563 states and 823 transitions. [2018-12-09 03:05:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:49,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-09 03:05:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:49,319 INFO L225 Difference]: With dead ends: 563 [2018-12-09 03:05:49,319 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:05:49,320 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-09 03:05:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:05:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-12-09 03:05:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2018-12-09 03:05:49,330 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 119 [2018-12-09 03:05:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:49,330 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2018-12-09 03:05:49,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2018-12-09 03:05:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 03:05:49,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:49,331 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] [2018-12-09 03:05:49,331 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:49,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2076005651, now seen corresponding path program 1 times [2018-12-09 03:05:49,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:49,374 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-09 03:05:49,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:49,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:49,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:49,375 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand 4 states. [2018-12-09 03:05:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:49,551 INFO L93 Difference]: Finished difference Result 563 states and 821 transitions. [2018-12-09 03:05:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:49,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-09 03:05:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:49,553 INFO L225 Difference]: With dead ends: 563 [2018-12-09 03:05:49,553 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 03:05:49,553 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-09 03:05:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 03:05:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2018-12-09 03:05:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 408 transitions. [2018-12-09 03:05:49,562 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 408 transitions. Word has length 120 [2018-12-09 03:05:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:49,562 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 408 transitions. [2018-12-09 03:05:49,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 408 transitions. [2018-12-09 03:05:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 03:05:49,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:49,562 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] [2018-12-09 03:05:49,562 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:49,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1219900889, now seen corresponding path program 1 times [2018-12-09 03:05:49,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:49,597 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-09 03:05:49,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:49,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:49,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:49,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:49,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:49,598 INFO L87 Difference]: Start difference. First operand 283 states and 408 transitions. Second operand 4 states. [2018-12-09 03:05:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:49,767 INFO L93 Difference]: Finished difference Result 561 states and 817 transitions. [2018-12-09 03:05:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:49,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 03:05:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:49,768 INFO L225 Difference]: With dead ends: 561 [2018-12-09 03:05:49,768 INFO L226 Difference]: Without dead ends: 303 [2018-12-09 03:05:49,769 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-09 03:05:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-09 03:05:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 283. [2018-12-09 03:05:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 03:05:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2018-12-09 03:05:49,778 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 121 [2018-12-09 03:05:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:49,778 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2018-12-09 03:05:49,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2018-12-09 03:05:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 03:05:49,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:49,779 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] [2018-12-09 03:05:49,779 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:49,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2116773451, now seen corresponding path program 1 times [2018-12-09 03:05:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:49,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:49,818 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-09 03:05:49,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:49,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:49,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:49,819 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand 4 states. [2018-12-09 03:05:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:50,014 INFO L93 Difference]: Finished difference Result 612 states and 896 transitions. [2018-12-09 03:05:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:50,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 03:05:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:50,015 INFO L225 Difference]: With dead ends: 612 [2018-12-09 03:05:50,015 INFO L226 Difference]: Without dead ends: 354 [2018-12-09 03:05:50,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-09 03:05:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-09 03:05:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2018-12-09 03:05:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-09 03:05:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 464 transitions. [2018-12-09 03:05:50,026 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 464 transitions. Word has length 121 [2018-12-09 03:05:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:50,026 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 464 transitions. [2018-12-09 03:05:50,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 464 transitions. [2018-12-09 03:05:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 03:05:50,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:50,027 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] [2018-12-09 03:05:50,027 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:50,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash 250827803, now seen corresponding path program 1 times [2018-12-09 03:05:50,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:50,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:50,061 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-09 03:05:50,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:50,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:50,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:50,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:50,062 INFO L87 Difference]: Start difference. First operand 315 states and 464 transitions. Second operand 4 states. [2018-12-09 03:05:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:50,292 INFO L93 Difference]: Finished difference Result 707 states and 1056 transitions. [2018-12-09 03:05:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:50,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-09 03:05:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:50,294 INFO L225 Difference]: With dead ends: 707 [2018-12-09 03:05:50,294 INFO L226 Difference]: Without dead ends: 417 [2018-12-09 03:05:50,294 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-09 03:05:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-09 03:05:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2018-12-09 03:05:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-09 03:05:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 535 transitions. [2018-12-09 03:05:50,306 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 535 transitions. Word has length 122 [2018-12-09 03:05:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:50,306 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 535 transitions. [2018-12-09 03:05:50,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 535 transitions. [2018-12-09 03:05:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 03:05:50,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:50,307 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] [2018-12-09 03:05:50,307 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:50,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1089974990, now seen corresponding path program 1 times [2018-12-09 03:05:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:50,338 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-09 03:05:50,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:50,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:50,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:50,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:50,339 INFO L87 Difference]: Start difference. First operand 354 states and 535 transitions. Second operand 4 states. [2018-12-09 03:05:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:50,493 INFO L93 Difference]: Finished difference Result 709 states and 1075 transitions. [2018-12-09 03:05:50,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:50,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-09 03:05:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:50,494 INFO L225 Difference]: With dead ends: 709 [2018-12-09 03:05:50,494 INFO L226 Difference]: Without dead ends: 380 [2018-12-09 03:05:50,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-09 03:05:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-09 03:05:50,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 354. [2018-12-09 03:05:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-09 03:05:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2018-12-09 03:05:50,505 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 123 [2018-12-09 03:05:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:50,505 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2018-12-09 03:05:50,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2018-12-09 03:05:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 03:05:50,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:50,505 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] [2018-12-09 03:05:50,505 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:50,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash -820775515, now seen corresponding path program 1 times [2018-12-09 03:05:50,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:50,535 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-09 03:05:50,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:50,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:50,536 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. Second operand 4 states. [2018-12-09 03:05:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:50,763 INFO L93 Difference]: Finished difference Result 740 states and 1117 transitions. [2018-12-09 03:05:50,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:50,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-09 03:05:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:50,764 INFO L225 Difference]: With dead ends: 740 [2018-12-09 03:05:50,764 INFO L226 Difference]: Without dead ends: 411 [2018-12-09 03:05:50,764 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-09 03:05:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-09 03:05:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 353. [2018-12-09 03:05:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-09 03:05:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2018-12-09 03:05:50,775 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 123 [2018-12-09 03:05:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:50,775 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2018-12-09 03:05:50,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2018-12-09 03:05:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 03:05:50,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:50,776 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] [2018-12-09 03:05:50,776 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:50,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:50,776 INFO L82 PathProgramCache]: Analyzing trace with hash 139990295, now seen corresponding path program 1 times [2018-12-09 03:05:50,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:50,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:50,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:50,804 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-09 03:05:50,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:50,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:50,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:50,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:50,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:50,805 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2018-12-09 03:05:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:50,973 INFO L93 Difference]: Finished difference Result 707 states and 1071 transitions. [2018-12-09 03:05:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:50,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-09 03:05:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:50,974 INFO L225 Difference]: With dead ends: 707 [2018-12-09 03:05:50,974 INFO L226 Difference]: Without dead ends: 379 [2018-12-09 03:05:50,975 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-09 03:05:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-09 03:05:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2018-12-09 03:05:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-09 03:05:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2018-12-09 03:05:50,987 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 124 [2018-12-09 03:05:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:50,987 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2018-12-09 03:05:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2018-12-09 03:05:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 03:05:50,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:50,988 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] [2018-12-09 03:05:50,988 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:50,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2007560723, now seen corresponding path program 1 times [2018-12-09 03:05:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:50,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:51,020 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-09 03:05:51,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:51,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:51,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:51,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:51,021 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2018-12-09 03:05:51,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:51,200 INFO L93 Difference]: Finished difference Result 707 states and 1069 transitions. [2018-12-09 03:05:51,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:51,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-09 03:05:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:51,201 INFO L225 Difference]: With dead ends: 707 [2018-12-09 03:05:51,201 INFO L226 Difference]: Without dead ends: 379 [2018-12-09 03:05:51,201 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-09 03:05:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-09 03:05:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2018-12-09 03:05:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-09 03:05:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 531 transitions. [2018-12-09 03:05:51,212 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 531 transitions. Word has length 125 [2018-12-09 03:05:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:51,212 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 531 transitions. [2018-12-09 03:05:51,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 531 transitions. [2018-12-09 03:05:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-09 03:05:51,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:51,213 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] [2018-12-09 03:05:51,213 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:51,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1483934734, now seen corresponding path program 1 times [2018-12-09 03:05:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:51,244 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-09 03:05:51,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:51,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:51,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:51,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:51,244 INFO L87 Difference]: Start difference. First operand 353 states and 531 transitions. Second operand 4 states. [2018-12-09 03:05:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:51,393 INFO L93 Difference]: Finished difference Result 697 states and 1055 transitions. [2018-12-09 03:05:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:51,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-09 03:05:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:51,394 INFO L225 Difference]: With dead ends: 697 [2018-12-09 03:05:51,394 INFO L226 Difference]: Without dead ends: 369 [2018-12-09 03:05:51,395 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-09 03:05:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-09 03:05:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2018-12-09 03:05:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-09 03:05:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2018-12-09 03:05:51,405 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 126 [2018-12-09 03:05:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:51,405 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2018-12-09 03:05:51,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2018-12-09 03:05:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 03:05:51,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:51,406 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] [2018-12-09 03:05:51,406 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:51,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1666532328, now seen corresponding path program 1 times [2018-12-09 03:05:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:51,439 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-09 03:05:51,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:51,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:51,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:51,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:51,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:51,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:51,440 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2018-12-09 03:05:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:51,671 INFO L93 Difference]: Finished difference Result 783 states and 1188 transitions. [2018-12-09 03:05:51,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:51,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 03:05:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:51,673 INFO L225 Difference]: With dead ends: 783 [2018-12-09 03:05:51,673 INFO L226 Difference]: Without dead ends: 455 [2018-12-09 03:05:51,673 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-09 03:05:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-09 03:05:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 392. [2018-12-09 03:05:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-09 03:05:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 601 transitions. [2018-12-09 03:05:51,685 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 601 transitions. Word has length 127 [2018-12-09 03:05:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:51,685 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 601 transitions. [2018-12-09 03:05:51,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 601 transitions. [2018-12-09 03:05:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 03:05:51,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:51,686 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] [2018-12-09 03:05:51,686 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:51,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash 116391800, now seen corresponding path program 1 times [2018-12-09 03:05:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:51,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:51,717 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-09 03:05:51,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:51,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:51,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:51,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:51,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:51,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:51,717 INFO L87 Difference]: Start difference. First operand 392 states and 601 transitions. Second operand 4 states. [2018-12-09 03:05:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:51,951 INFO L93 Difference]: Finished difference Result 816 states and 1251 transitions. [2018-12-09 03:05:51,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:51,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-09 03:05:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:51,952 INFO L225 Difference]: With dead ends: 816 [2018-12-09 03:05:51,952 INFO L226 Difference]: Without dead ends: 449 [2018-12-09 03:05:51,952 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-09 03:05:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-09 03:05:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2018-12-09 03:05:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-09 03:05:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2018-12-09 03:05:51,964 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 128 [2018-12-09 03:05:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:51,964 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2018-12-09 03:05:51,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2018-12-09 03:05:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 03:05:51,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:51,965 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-09 03:05:51,965 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:51,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:51,965 INFO L82 PathProgramCache]: Analyzing trace with hash 176061736, now seen corresponding path program 1 times [2018-12-09 03:05:51,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:51,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:52,002 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-09 03:05:52,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:52,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:52,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:52,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:52,003 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand 4 states. [2018-12-09 03:05:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:52,170 INFO L93 Difference]: Finished difference Result 696 states and 1052 transitions. [2018-12-09 03:05:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:52,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-09 03:05:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:52,171 INFO L225 Difference]: With dead ends: 696 [2018-12-09 03:05:52,171 INFO L226 Difference]: Without dead ends: 368 [2018-12-09 03:05:52,171 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-09 03:05:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-09 03:05:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2018-12-09 03:05:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-09 03:05:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 533 transitions. [2018-12-09 03:05:52,183 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 533 transitions. Word has length 129 [2018-12-09 03:05:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:52,183 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 533 transitions. [2018-12-09 03:05:52,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 533 transitions. [2018-12-09 03:05:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 03:05:52,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:52,184 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] [2018-12-09 03:05:52,184 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:52,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash -25859422, now seen corresponding path program 1 times [2018-12-09 03:05:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:52,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:52,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:52,215 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-09 03:05:52,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:52,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:52,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:52,216 INFO L87 Difference]: Start difference. First operand 356 states and 533 transitions. Second operand 4 states. [2018-12-09 03:05:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:52,367 INFO L93 Difference]: Finished difference Result 703 states and 1059 transitions. [2018-12-09 03:05:52,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:52,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-09 03:05:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:52,368 INFO L225 Difference]: With dead ends: 703 [2018-12-09 03:05:52,368 INFO L226 Difference]: Without dead ends: 372 [2018-12-09 03:05:52,369 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-09 03:05:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-09 03:05:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2018-12-09 03:05:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-09 03:05:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 532 transitions. [2018-12-09 03:05:52,381 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 532 transitions. Word has length 136 [2018-12-09 03:05:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:52,381 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 532 transitions. [2018-12-09 03:05:52,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 532 transitions. [2018-12-09 03:05:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-09 03:05:52,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:52,381 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] [2018-12-09 03:05:52,381 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:52,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash 739391475, now seen corresponding path program 1 times [2018-12-09 03:05:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:52,413 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-09 03:05:52,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:52,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:52,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:52,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:52,414 INFO L87 Difference]: Start difference. First operand 356 states and 532 transitions. Second operand 4 states. [2018-12-09 03:05:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:52,628 INFO L93 Difference]: Finished difference Result 749 states and 1132 transitions. [2018-12-09 03:05:52,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:52,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-12-09 03:05:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:52,629 INFO L225 Difference]: With dead ends: 749 [2018-12-09 03:05:52,629 INFO L226 Difference]: Without dead ends: 418 [2018-12-09 03:05:52,629 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-09 03:05:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-09 03:05:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2018-12-09 03:05:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-09 03:05:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2018-12-09 03:05:52,642 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 136 [2018-12-09 03:05:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:52,642 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2018-12-09 03:05:52,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2018-12-09 03:05:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-09 03:05:52,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:52,642 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] [2018-12-09 03:05:52,643 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:52,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1373718557, now seen corresponding path program 1 times [2018-12-09 03:05:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:52,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:52,677 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-09 03:05:52,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:52,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:52,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:52,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:52,678 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand 4 states. [2018-12-09 03:05:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:52,825 INFO L93 Difference]: Finished difference Result 757 states and 1153 transitions. [2018-12-09 03:05:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:52,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-09 03:05:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:52,826 INFO L225 Difference]: With dead ends: 757 [2018-12-09 03:05:52,826 INFO L226 Difference]: Without dead ends: 398 [2018-12-09 03:05:52,826 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-09 03:05:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-12-09 03:05:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2018-12-09 03:05:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-09 03:05:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 580 transitions. [2018-12-09 03:05:52,842 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 580 transitions. Word has length 137 [2018-12-09 03:05:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:52,842 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 580 transitions. [2018-12-09 03:05:52,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 580 transitions. [2018-12-09 03:05:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-09 03:05:52,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:52,843 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] [2018-12-09 03:05:52,843 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1393961092, now seen corresponding path program 1 times [2018-12-09 03:05:52,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:52,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:52,885 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-09 03:05:52,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:52,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:52,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:52,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:52,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:52,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:52,886 INFO L87 Difference]: Start difference. First operand 384 states and 580 transitions. Second operand 4 states. [2018-12-09 03:05:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:53,121 INFO L93 Difference]: Finished difference Result 839 states and 1279 transitions. [2018-12-09 03:05:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:53,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-09 03:05:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:53,122 INFO L225 Difference]: With dead ends: 839 [2018-12-09 03:05:53,122 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:53,123 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-09 03:05:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 396. [2018-12-09 03:05:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-09 03:05:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2018-12-09 03:05:53,137 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 137 [2018-12-09 03:05:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:53,137 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2018-12-09 03:05:53,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2018-12-09 03:05:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-09 03:05:53,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:53,138 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] [2018-12-09 03:05:53,138 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:53,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash -693644275, now seen corresponding path program 1 times [2018-12-09 03:05:53,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:53,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:53,167 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-09 03:05:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:53,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:53,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:53,168 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand 4 states. [2018-12-09 03:05:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:53,395 INFO L93 Difference]: Finished difference Result 851 states and 1295 transitions. [2018-12-09 03:05:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:53,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-09 03:05:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:53,397 INFO L225 Difference]: With dead ends: 851 [2018-12-09 03:05:53,397 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:53,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-09 03:05:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 397. [2018-12-09 03:05:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-12-09 03:05:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 598 transitions. [2018-12-09 03:05:53,410 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 598 transitions. Word has length 138 [2018-12-09 03:05:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:53,411 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 598 transitions. [2018-12-09 03:05:53,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 598 transitions. [2018-12-09 03:05:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 03:05:53,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:53,411 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] [2018-12-09 03:05:53,411 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:53,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2080428617, now seen corresponding path program 1 times [2018-12-09 03:05:53,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:53,444 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-09 03:05:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:53,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:53,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:53,445 INFO L87 Difference]: Start difference. First operand 397 states and 598 transitions. Second operand 4 states. [2018-12-09 03:05:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:53,658 INFO L93 Difference]: Finished difference Result 852 states and 1295 transitions. [2018-12-09 03:05:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:53,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-09 03:05:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:53,659 INFO L225 Difference]: With dead ends: 852 [2018-12-09 03:05:53,659 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:53,659 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-09 03:05:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 398. [2018-12-09 03:05:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-09 03:05:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 599 transitions. [2018-12-09 03:05:53,673 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 599 transitions. Word has length 139 [2018-12-09 03:05:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:53,673 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 599 transitions. [2018-12-09 03:05:53,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 599 transitions. [2018-12-09 03:05:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 03:05:53,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:53,674 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] [2018-12-09 03:05:53,674 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:53,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 552127848, now seen corresponding path program 1 times [2018-12-09 03:05:53,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:53,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:53,703 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-09 03:05:53,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:53,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:53,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:53,703 INFO L87 Difference]: Start difference. First operand 398 states and 599 transitions. Second operand 4 states. [2018-12-09 03:05:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:53,912 INFO L93 Difference]: Finished difference Result 843 states and 1283 transitions. [2018-12-09 03:05:53,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:53,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-09 03:05:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:53,913 INFO L225 Difference]: With dead ends: 843 [2018-12-09 03:05:53,913 INFO L226 Difference]: Without dead ends: 470 [2018-12-09 03:05:53,913 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-09 03:05:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-09 03:05:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 399. [2018-12-09 03:05:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 03:05:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2018-12-09 03:05:53,927 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 140 [2018-12-09 03:05:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:53,928 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2018-12-09 03:05:53,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2018-12-09 03:05:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 03:05:53,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:53,928 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] [2018-12-09 03:05:53,928 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:53,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1168460785, now seen corresponding path program 1 times [2018-12-09 03:05:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:53,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:53,958 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-09 03:05:53,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:53,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:53,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:53,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:53,958 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand 4 states. [2018-12-09 03:05:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:54,203 INFO L93 Difference]: Finished difference Result 854 states and 1295 transitions. [2018-12-09 03:05:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:54,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-09 03:05:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:54,205 INFO L225 Difference]: With dead ends: 854 [2018-12-09 03:05:54,205 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:54,205 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-09 03:05:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-09 03:05:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 03:05:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2018-12-09 03:05:54,221 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 142 [2018-12-09 03:05:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:54,221 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2018-12-09 03:05:54,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2018-12-09 03:05:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 03:05:54,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:54,222 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] [2018-12-09 03:05:54,222 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:54,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2001897946, now seen corresponding path program 1 times [2018-12-09 03:05:54,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:54,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:54,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:54,256 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-09 03:05:54,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:54,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:54,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:54,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:54,257 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand 4 states. [2018-12-09 03:05:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:54,498 INFO L93 Difference]: Finished difference Result 854 states and 1293 transitions. [2018-12-09 03:05:54,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:54,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-09 03:05:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:54,499 INFO L225 Difference]: With dead ends: 854 [2018-12-09 03:05:54,499 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:54,499 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-09 03:05:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-09 03:05:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 03:05:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2018-12-09 03:05:54,514 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 143 [2018-12-09 03:05:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:54,514 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2018-12-09 03:05:54,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2018-12-09 03:05:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 03:05:54,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:54,515 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] [2018-12-09 03:05:54,515 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:54,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash -122998390, now seen corresponding path program 1 times [2018-12-09 03:05:54,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:54,545 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-09 03:05:54,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:54,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:54,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:54,546 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand 4 states. [2018-12-09 03:05:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:54,851 INFO L93 Difference]: Finished difference Result 854 states and 1291 transitions. [2018-12-09 03:05:54,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:54,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-09 03:05:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:54,852 INFO L225 Difference]: With dead ends: 854 [2018-12-09 03:05:54,853 INFO L226 Difference]: Without dead ends: 480 [2018-12-09 03:05:54,853 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-09 03:05:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-12-09 03:05:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 399. [2018-12-09 03:05:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-09 03:05:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2018-12-09 03:05:54,871 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 144 [2018-12-09 03:05:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:54,871 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2018-12-09 03:05:54,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2018-12-09 03:05:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 03:05:54,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:54,872 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] [2018-12-09 03:05:54,872 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:54,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1102922741, now seen corresponding path program 1 times [2018-12-09 03:05:54,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:54,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:54,902 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-09 03:05:54,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:54,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:54,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:54,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:54,903 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand 4 states. [2018-12-09 03:05:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:55,169 INFO L93 Difference]: Finished difference Result 844 states and 1277 transitions. [2018-12-09 03:05:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:55,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 03:05:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:55,170 INFO L225 Difference]: With dead ends: 844 [2018-12-09 03:05:55,170 INFO L226 Difference]: Without dead ends: 470 [2018-12-09 03:05:55,171 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-09 03:05:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-09 03:05:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 384. [2018-12-09 03:05:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-09 03:05:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 576 transitions. [2018-12-09 03:05:55,189 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 576 transitions. Word has length 145 [2018-12-09 03:05:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:55,190 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 576 transitions. [2018-12-09 03:05:55,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 576 transitions. [2018-12-09 03:05:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 03:05:55,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:55,190 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] [2018-12-09 03:05:55,190 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:55,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1178704546, now seen corresponding path program 1 times [2018-12-09 03:05:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:55,225 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-09 03:05:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:55,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:55,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:55,226 INFO L87 Difference]: Start difference. First operand 384 states and 576 transitions. Second operand 4 states. [2018-12-09 03:05:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:55,456 INFO L93 Difference]: Finished difference Result 829 states and 1255 transitions. [2018-12-09 03:05:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:55,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-09 03:05:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:55,457 INFO L225 Difference]: With dead ends: 829 [2018-12-09 03:05:55,457 INFO L226 Difference]: Without dead ends: 470 [2018-12-09 03:05:55,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-09 03:05:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-09 03:05:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 412. [2018-12-09 03:05:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-09 03:05:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 621 transitions. [2018-12-09 03:05:55,474 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 621 transitions. Word has length 147 [2018-12-09 03:05:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:55,474 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 621 transitions. [2018-12-09 03:05:55,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 621 transitions. [2018-12-09 03:05:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 03:05:55,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:55,475 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] [2018-12-09 03:05:55,475 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:55,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1897099021, now seen corresponding path program 1 times [2018-12-09 03:05:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:55,507 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-09 03:05:55,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:55,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:55,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:55,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:55,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:55,508 INFO L87 Difference]: Start difference. First operand 412 states and 621 transitions. Second operand 4 states. [2018-12-09 03:05:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:55,728 INFO L93 Difference]: Finished difference Result 849 states and 1286 transitions. [2018-12-09 03:05:55,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:55,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-09 03:05:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:55,730 INFO L225 Difference]: With dead ends: 849 [2018-12-09 03:05:55,730 INFO L226 Difference]: Without dead ends: 462 [2018-12-09 03:05:55,730 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-09 03:05:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-09 03:05:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2018-12-09 03:05:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-09 03:05:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 622 transitions. [2018-12-09 03:05:55,747 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 622 transitions. Word has length 148 [2018-12-09 03:05:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:55,747 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 622 transitions. [2018-12-09 03:05:55,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 622 transitions. [2018-12-09 03:05:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 03:05:55,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:55,747 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] [2018-12-09 03:05:55,748 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:55,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1056991384, now seen corresponding path program 1 times [2018-12-09 03:05:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:55,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:55,778 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-09 03:05:55,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:55,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:55,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:55,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:55,779 INFO L87 Difference]: Start difference. First operand 413 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:56,007 INFO L93 Difference]: Finished difference Result 850 states and 1286 transitions. [2018-12-09 03:05:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:56,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-09 03:05:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:56,008 INFO L225 Difference]: With dead ends: 850 [2018-12-09 03:05:56,008 INFO L226 Difference]: Without dead ends: 462 [2018-12-09 03:05:56,009 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-09 03:05:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-09 03:05:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2018-12-09 03:05:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-09 03:05:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2018-12-09 03:05:56,031 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 150 [2018-12-09 03:05:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:56,031 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2018-12-09 03:05:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2018-12-09 03:05:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 03:05:56,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:56,032 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] [2018-12-09 03:05:56,032 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:56,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash 582355175, now seen corresponding path program 1 times [2018-12-09 03:05:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:56,064 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-09 03:05:56,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:56,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:56,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:56,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:56,065 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand 4 states. [2018-12-09 03:05:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:56,276 INFO L93 Difference]: Finished difference Result 848 states and 1282 transitions. [2018-12-09 03:05:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:56,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 03:05:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:56,277 INFO L225 Difference]: With dead ends: 848 [2018-12-09 03:05:56,277 INFO L226 Difference]: Without dead ends: 460 [2018-12-09 03:05:56,277 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-09 03:05:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-09 03:05:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 413. [2018-12-09 03:05:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-09 03:05:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 620 transitions. [2018-12-09 03:05:56,299 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 620 transitions. Word has length 151 [2018-12-09 03:05:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:56,299 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 620 transitions. [2018-12-09 03:05:56,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 620 transitions. [2018-12-09 03:05:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 03:05:56,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:56,300 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] [2018-12-09 03:05:56,300 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:56,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2104357786, now seen corresponding path program 1 times [2018-12-09 03:05:56,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:56,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:56,341 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-09 03:05:56,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:56,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:56,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:56,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:56,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:56,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:56,341 INFO L87 Difference]: Start difference. First operand 413 states and 620 transitions. Second operand 4 states. [2018-12-09 03:05:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:56,541 INFO L93 Difference]: Finished difference Result 845 states and 1276 transitions. [2018-12-09 03:05:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:56,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 03:05:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:56,542 INFO L225 Difference]: With dead ends: 845 [2018-12-09 03:05:56,542 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 03:05:56,542 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-09 03:05:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 03:05:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 416. [2018-12-09 03:05:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-09 03:05:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 625 transitions. [2018-12-09 03:05:56,560 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 625 transitions. Word has length 151 [2018-12-09 03:05:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:56,560 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 625 transitions. [2018-12-09 03:05:56,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 625 transitions. [2018-12-09 03:05:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 03:05:56,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:56,561 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] [2018-12-09 03:05:56,561 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1696872284, now seen corresponding path program 1 times [2018-12-09 03:05:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:56,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:56,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:56,595 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-09 03:05:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:56,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:56,596 INFO L87 Difference]: Start difference. First operand 416 states and 625 transitions. Second operand 4 states. [2018-12-09 03:05:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:56,836 INFO L93 Difference]: Finished difference Result 841 states and 1268 transitions. [2018-12-09 03:05:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:56,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-09 03:05:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:56,837 INFO L225 Difference]: With dead ends: 841 [2018-12-09 03:05:56,837 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 03:05:56,838 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-09 03:05:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 03:05:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2018-12-09 03:05:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-09 03:05:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 624 transitions. [2018-12-09 03:05:56,857 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 624 transitions. Word has length 151 [2018-12-09 03:05:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:56,857 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 624 transitions. [2018-12-09 03:05:56,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 624 transitions. [2018-12-09 03:05:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 03:05:56,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:56,858 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] [2018-12-09 03:05:56,858 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:56,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1352801141, now seen corresponding path program 1 times [2018-12-09 03:05:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:56,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:56,890 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-09 03:05:56,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:56,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:56,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:56,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:56,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:56,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:56,891 INFO L87 Difference]: Start difference. First operand 416 states and 624 transitions. Second operand 4 states. [2018-12-09 03:05:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:57,128 INFO L93 Difference]: Finished difference Result 861 states and 1297 transitions. [2018-12-09 03:05:57,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:57,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 03:05:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:57,130 INFO L225 Difference]: With dead ends: 861 [2018-12-09 03:05:57,130 INFO L226 Difference]: Without dead ends: 470 [2018-12-09 03:05:57,130 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-09 03:05:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-09 03:05:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2018-12-09 03:05:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-09 03:05:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 623 transitions. [2018-12-09 03:05:57,151 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 623 transitions. Word has length 152 [2018-12-09 03:05:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:57,151 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 623 transitions. [2018-12-09 03:05:57,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 623 transitions. [2018-12-09 03:05:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 03:05:57,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:57,152 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] [2018-12-09 03:05:57,152 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:57,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:57,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1493956635, now seen corresponding path program 1 times [2018-12-09 03:05:57,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:57,182 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-09 03:05:57,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:57,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:57,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:57,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:57,183 INFO L87 Difference]: Start difference. First operand 416 states and 623 transitions. Second operand 4 states. [2018-12-09 03:05:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:57,408 INFO L93 Difference]: Finished difference Result 841 states and 1264 transitions. [2018-12-09 03:05:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:57,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 03:05:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:57,410 INFO L225 Difference]: With dead ends: 841 [2018-12-09 03:05:57,410 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 03:05:57,410 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-09 03:05:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 03:05:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2018-12-09 03:05:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-09 03:05:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 622 transitions. [2018-12-09 03:05:57,429 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 622 transitions. Word has length 152 [2018-12-09 03:05:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:57,429 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 622 transitions. [2018-12-09 03:05:57,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 622 transitions. [2018-12-09 03:05:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 03:05:57,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:57,430 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] [2018-12-09 03:05:57,430 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:57,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash -795071872, now seen corresponding path program 1 times [2018-12-09 03:05:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:57,465 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-09 03:05:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:57,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:57,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:57,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:57,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:57,465 INFO L87 Difference]: Start difference. First operand 416 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:57,686 INFO L93 Difference]: Finished difference Result 853 states and 1280 transitions. [2018-12-09 03:05:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:57,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 03:05:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:57,688 INFO L225 Difference]: With dead ends: 853 [2018-12-09 03:05:57,688 INFO L226 Difference]: Without dead ends: 462 [2018-12-09 03:05:57,688 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-09 03:05:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-09 03:05:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 416. [2018-12-09 03:05:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-09 03:05:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 621 transitions. [2018-12-09 03:05:57,711 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 621 transitions. Word has length 153 [2018-12-09 03:05:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:57,711 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 621 transitions. [2018-12-09 03:05:57,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 621 transitions. [2018-12-09 03:05:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 03:05:57,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:57,712 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] [2018-12-09 03:05:57,712 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:57,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 640566716, now seen corresponding path program 1 times [2018-12-09 03:05:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:57,746 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-09 03:05:57,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:57,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:57,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:57,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:57,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:57,747 INFO L87 Difference]: Start difference. First operand 416 states and 621 transitions. Second operand 4 states. [2018-12-09 03:05:57,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:57,947 INFO L93 Difference]: Finished difference Result 848 states and 1272 transitions. [2018-12-09 03:05:57,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:57,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 03:05:57,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:57,948 INFO L225 Difference]: With dead ends: 848 [2018-12-09 03:05:57,948 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 03:05:57,948 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-09 03:05:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 03:05:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 417. [2018-12-09 03:05:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 03:05:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2018-12-09 03:05:57,968 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 153 [2018-12-09 03:05:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:57,968 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2018-12-09 03:05:57,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2018-12-09 03:05:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 03:05:57,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:57,968 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] [2018-12-09 03:05:57,968 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:57,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1120308001, now seen corresponding path program 1 times [2018-12-09 03:05:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:57,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:57,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:58,000 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-09 03:05:58,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:58,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:58,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:58,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:58,001 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:58,202 INFO L93 Difference]: Finished difference Result 843 states and 1262 transitions. [2018-12-09 03:05:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:58,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 03:05:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:58,203 INFO L225 Difference]: With dead ends: 843 [2018-12-09 03:05:58,203 INFO L226 Difference]: Without dead ends: 451 [2018-12-09 03:05:58,203 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-09 03:05:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-09 03:05:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2018-12-09 03:05:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 03:05:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 621 transitions. [2018-12-09 03:05:58,222 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 621 transitions. Word has length 153 [2018-12-09 03:05:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:58,223 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 621 transitions. [2018-12-09 03:05:58,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:58,223 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 621 transitions. [2018-12-09 03:05:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 03:05:58,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:58,223 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] [2018-12-09 03:05:58,223 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:58,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:58,223 INFO L82 PathProgramCache]: Analyzing trace with hash -213556974, now seen corresponding path program 1 times [2018-12-09 03:05:58,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:58,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:58,257 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-09 03:05:58,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:58,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:58,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:58,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:58,258 INFO L87 Difference]: Start difference. First operand 417 states and 621 transitions. Second operand 4 states. [2018-12-09 03:05:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:58,451 INFO L93 Difference]: Finished difference Result 845 states and 1265 transitions. [2018-12-09 03:05:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:58,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 03:05:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:58,452 INFO L225 Difference]: With dead ends: 845 [2018-12-09 03:05:58,452 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 03:05:58,452 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-09 03:05:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 03:05:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 418. [2018-12-09 03:05:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-12-09 03:05:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 622 transitions. [2018-12-09 03:05:58,472 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 622 transitions. Word has length 154 [2018-12-09 03:05:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 622 transitions. [2018-12-09 03:05:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 622 transitions. [2018-12-09 03:05:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 03:05:58,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:58,473 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] [2018-12-09 03:05:58,473 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 242980067, now seen corresponding path program 1 times [2018-12-09 03:05:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:58,523 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-09 03:05:58,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:58,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:58,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:58,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:58,524 INFO L87 Difference]: Start difference. First operand 418 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:58,712 INFO L93 Difference]: Finished difference Result 846 states and 1265 transitions. [2018-12-09 03:05:58,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:58,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 03:05:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:58,713 INFO L225 Difference]: With dead ends: 846 [2018-12-09 03:05:58,713 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 03:05:58,713 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-09 03:05:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 03:05:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2018-12-09 03:05:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 03:05:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 623 transitions. [2018-12-09 03:05:58,734 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 623 transitions. Word has length 154 [2018-12-09 03:05:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:58,734 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 623 transitions. [2018-12-09 03:05:58,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 623 transitions. [2018-12-09 03:05:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 03:05:58,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:58,734 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] [2018-12-09 03:05:58,734 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:58,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash 251095872, now seen corresponding path program 1 times [2018-12-09 03:05:58,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:58,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:58,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:58,768 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-09 03:05:58,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:58,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:58,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:58,769 INFO L87 Difference]: Start difference. First operand 419 states and 623 transitions. Second operand 4 states. [2018-12-09 03:05:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:58,979 INFO L93 Difference]: Finished difference Result 837 states and 1252 transitions. [2018-12-09 03:05:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:58,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 03:05:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:58,980 INFO L225 Difference]: With dead ends: 837 [2018-12-09 03:05:58,980 INFO L226 Difference]: Without dead ends: 443 [2018-12-09 03:05:58,980 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-09 03:05:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-09 03:05:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2018-12-09 03:05:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 03:05:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 622 transitions. [2018-12-09 03:05:59,002 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 622 transitions. Word has length 154 [2018-12-09 03:05:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:59,003 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 622 transitions. [2018-12-09 03:05:59,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 622 transitions. [2018-12-09 03:05:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 03:05:59,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:59,003 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] [2018-12-09 03:05:59,003 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:59,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash -751840539, now seen corresponding path program 1 times [2018-12-09 03:05:59,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:59,037 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-09 03:05:59,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:59,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:59,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:59,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:59,037 INFO L87 Difference]: Start difference. First operand 419 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:59,278 INFO L93 Difference]: Finished difference Result 856 states and 1274 transitions. [2018-12-09 03:05:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:59,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 03:05:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:59,279 INFO L225 Difference]: With dead ends: 856 [2018-12-09 03:05:59,280 INFO L226 Difference]: Without dead ends: 462 [2018-12-09 03:05:59,280 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-09 03:05:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-12-09 03:05:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 419. [2018-12-09 03:05:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 03:05:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 621 transitions. [2018-12-09 03:05:59,306 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 621 transitions. Word has length 155 [2018-12-09 03:05:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:59,306 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 621 transitions. [2018-12-09 03:05:59,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 621 transitions. [2018-12-09 03:05:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 03:05:59,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:59,307 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] [2018-12-09 03:05:59,307 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:59,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1459515309, now seen corresponding path program 1 times [2018-12-09 03:05:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:59,341 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-09 03:05:59,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:59,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:59,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:59,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:59,342 INFO L87 Difference]: Start difference. First operand 419 states and 621 transitions. Second operand 4 states. [2018-12-09 03:05:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:59,533 INFO L93 Difference]: Finished difference Result 845 states and 1259 transitions. [2018-12-09 03:05:59,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:59,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 03:05:59,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:59,534 INFO L225 Difference]: With dead ends: 845 [2018-12-09 03:05:59,534 INFO L226 Difference]: Without dead ends: 451 [2018-12-09 03:05:59,535 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-09 03:05:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-09 03:05:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 420. [2018-12-09 03:05:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-09 03:05:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 622 transitions. [2018-12-09 03:05:59,556 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 622 transitions. Word has length 155 [2018-12-09 03:05:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:59,556 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 622 transitions. [2018-12-09 03:05:59,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 622 transitions. [2018-12-09 03:05:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 03:05:59,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:59,557 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] [2018-12-09 03:05:59,557 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:59,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 343140410, now seen corresponding path program 1 times [2018-12-09 03:05:59,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:59,588 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-09 03:05:59,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:59,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:59,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:59,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:59,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:59,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:59,589 INFO L87 Difference]: Start difference. First operand 420 states and 622 transitions. Second operand 4 states. [2018-12-09 03:05:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:05:59,801 INFO L93 Difference]: Finished difference Result 855 states and 1270 transitions. [2018-12-09 03:05:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:05:59,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 03:05:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:05:59,802 INFO L225 Difference]: With dead ends: 855 [2018-12-09 03:05:59,802 INFO L226 Difference]: Without dead ends: 460 [2018-12-09 03:05:59,802 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-09 03:05:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-09 03:05:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2018-12-09 03:05:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-09 03:05:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 621 transitions. [2018-12-09 03:05:59,823 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 621 transitions. Word has length 156 [2018-12-09 03:05:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:05:59,824 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 621 transitions. [2018-12-09 03:05:59,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:05:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 621 transitions. [2018-12-09 03:05:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 03:05:59,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:05:59,824 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] [2018-12-09 03:05:59,824 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:05:59,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:05:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1865143021, now seen corresponding path program 1 times [2018-12-09 03:05:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:05:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:05:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:05:59,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:05:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:05:59,861 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-09 03:05:59,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:05:59,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:05:59,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:05:59,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:05:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:05:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:05:59,862 INFO L87 Difference]: Start difference. First operand 420 states and 621 transitions. Second operand 4 states. [2018-12-09 03:06:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:00,063 INFO L93 Difference]: Finished difference Result 852 states and 1264 transitions. [2018-12-09 03:06:00,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:00,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 03:06:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:00,064 INFO L225 Difference]: With dead ends: 852 [2018-12-09 03:06:00,064 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 03:06:00,064 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-09 03:06:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 03:06:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 420. [2018-12-09 03:06:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-09 03:06:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 620 transitions. [2018-12-09 03:06:00,086 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 620 transitions. Word has length 156 [2018-12-09 03:06:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 620 transitions. [2018-12-09 03:06:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 620 transitions. [2018-12-09 03:06:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 03:06:00,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:00,087 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] [2018-12-09 03:06:00,087 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -88756834, now seen corresponding path program 1 times [2018-12-09 03:06:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:00,124 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-09 03:06:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:00,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:00,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:00,125 INFO L87 Difference]: Start difference. First operand 420 states and 620 transitions. Second operand 4 states. [2018-12-09 03:06:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:00,323 INFO L93 Difference]: Finished difference Result 846 states and 1255 transitions. [2018-12-09 03:06:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:00,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 03:06:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:00,324 INFO L225 Difference]: With dead ends: 846 [2018-12-09 03:06:00,324 INFO L226 Difference]: Without dead ends: 451 [2018-12-09 03:06:00,324 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-09 03:06:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-09 03:06:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 421. [2018-12-09 03:06:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 03:06:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 621 transitions. [2018-12-09 03:06:00,352 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 621 transitions. Word has length 156 [2018-12-09 03:06:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:00,352 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 621 transitions. [2018-12-09 03:06:00,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 621 transitions. [2018-12-09 03:06:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 03:06:00,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:00,353 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] [2018-12-09 03:06:00,353 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:00,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1599895224, now seen corresponding path program 1 times [2018-12-09 03:06:00,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:00,399 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-09 03:06:00,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:00,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:00,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:00,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:00,400 INFO L87 Difference]: Start difference. First operand 421 states and 621 transitions. Second operand 4 states. [2018-12-09 03:06:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:00,597 INFO L93 Difference]: Finished difference Result 845 states and 1253 transitions. [2018-12-09 03:06:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:00,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-09 03:06:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:00,598 INFO L225 Difference]: With dead ends: 845 [2018-12-09 03:06:00,598 INFO L226 Difference]: Without dead ends: 449 [2018-12-09 03:06:00,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-09 03:06:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-09 03:06:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 422. [2018-12-09 03:06:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 622 transitions. [2018-12-09 03:06:00,620 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 622 transitions. Word has length 157 [2018-12-09 03:06:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:00,620 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 622 transitions. [2018-12-09 03:06:00,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2018-12-09 03:06:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 03:06:00,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:00,621 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] [2018-12-09 03:06:00,621 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1611555761, now seen corresponding path program 1 times [2018-12-09 03:06:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:00,659 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-09 03:06:00,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:00,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:00,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:00,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:00,660 INFO L87 Difference]: Start difference. First operand 422 states and 622 transitions. Second operand 4 states. [2018-12-09 03:06:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:00,879 INFO L93 Difference]: Finished difference Result 854 states and 1262 transitions. [2018-12-09 03:06:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:00,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 03:06:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:00,880 INFO L225 Difference]: With dead ends: 854 [2018-12-09 03:06:00,881 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 03:06:00,881 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-09 03:06:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 03:06:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-12-09 03:06:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 621 transitions. [2018-12-09 03:06:00,912 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 621 transitions. Word has length 158 [2018-12-09 03:06:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:00,912 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 621 transitions. [2018-12-09 03:06:00,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 621 transitions. [2018-12-09 03:06:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 03:06:00,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:00,913 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] [2018-12-09 03:06:00,913 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:00,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1309877025, now seen corresponding path program 1 times [2018-12-09 03:06:00,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:00,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:00,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:00,949 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-09 03:06:00,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:00,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:00,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:00,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:00,950 INFO L87 Difference]: Start difference. First operand 422 states and 621 transitions. Second operand 4 states. [2018-12-09 03:06:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:01,167 INFO L93 Difference]: Finished difference Result 850 states and 1255 transitions. [2018-12-09 03:06:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:01,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 03:06:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:01,168 INFO L225 Difference]: With dead ends: 850 [2018-12-09 03:06:01,168 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 03:06:01,169 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-09 03:06:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 03:06:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2018-12-09 03:06:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 620 transitions. [2018-12-09 03:06:01,193 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 620 transitions. Word has length 159 [2018-12-09 03:06:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:01,193 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 620 transitions. [2018-12-09 03:06:01,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 620 transitions. [2018-12-09 03:06:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 03:06:01,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:01,194 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] [2018-12-09 03:06:01,194 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:01,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -853339984, now seen corresponding path program 1 times [2018-12-09 03:06:01,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:01,234 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-09 03:06:01,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:01,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:01,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:01,235 INFO L87 Difference]: Start difference. First operand 422 states and 620 transitions. Second operand 4 states. [2018-12-09 03:06:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:01,446 INFO L93 Difference]: Finished difference Result 850 states and 1253 transitions. [2018-12-09 03:06:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:01,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 03:06:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:01,447 INFO L225 Difference]: With dead ends: 850 [2018-12-09 03:06:01,447 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 03:06:01,447 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-09 03:06:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 03:06:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2018-12-09 03:06:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 619 transitions. [2018-12-09 03:06:01,472 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 619 transitions. Word has length 159 [2018-12-09 03:06:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:01,472 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 619 transitions. [2018-12-09 03:06:01,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 619 transitions. [2018-12-09 03:06:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 03:06:01,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:01,473 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] [2018-12-09 03:06:01,473 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:01,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:01,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1833332096, now seen corresponding path program 1 times [2018-12-09 03:06:01,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:01,514 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-09 03:06:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:01,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:01,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:01,515 INFO L87 Difference]: Start difference. First operand 422 states and 619 transitions. Second operand 4 states. [2018-12-09 03:06:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:01,742 INFO L93 Difference]: Finished difference Result 848 states and 1249 transitions. [2018-12-09 03:06:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:01,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-09 03:06:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:01,743 INFO L225 Difference]: With dead ends: 848 [2018-12-09 03:06:01,743 INFO L226 Difference]: Without dead ends: 451 [2018-12-09 03:06:01,744 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-09 03:06:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-09 03:06:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2018-12-09 03:06:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 618 transitions. [2018-12-09 03:06:01,770 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 618 transitions. Word has length 160 [2018-12-09 03:06:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:01,770 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 618 transitions. [2018-12-09 03:06:01,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-12-09 03:06:01,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 03:06:01,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:01,771 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] [2018-12-09 03:06:01,771 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:01,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1385338325, now seen corresponding path program 1 times [2018-12-09 03:06:01,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:01,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:01,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:01,817 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-09 03:06:01,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:01,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:01,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:01,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:01,818 INFO L87 Difference]: Start difference. First operand 422 states and 618 transitions. Second operand 4 states. [2018-12-09 03:06:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:02,026 INFO L93 Difference]: Finished difference Result 848 states and 1247 transitions. [2018-12-09 03:06:02,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:02,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-09 03:06:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:02,027 INFO L225 Difference]: With dead ends: 848 [2018-12-09 03:06:02,027 INFO L226 Difference]: Without dead ends: 451 [2018-12-09 03:06:02,027 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-09 03:06:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-09 03:06:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2018-12-09 03:06:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-09 03:06:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 617 transitions. [2018-12-09 03:06:02,051 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 617 transitions. Word has length 161 [2018-12-09 03:06:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 617 transitions. [2018-12-09 03:06:02,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 617 transitions. [2018-12-09 03:06:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 03:06:02,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:02,052 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] [2018-12-09 03:06:02,052 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:02,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash -889833014, now seen corresponding path program 1 times [2018-12-09 03:06:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:02,091 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-09 03:06:02,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:02,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:02,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:02,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:02,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:02,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:02,092 INFO L87 Difference]: Start difference. First operand 422 states and 617 transitions. Second operand 4 states. [2018-12-09 03:06:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:02,313 INFO L93 Difference]: Finished difference Result 885 states and 1308 transitions. [2018-12-09 03:06:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:02,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-09 03:06:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:02,314 INFO L225 Difference]: With dead ends: 885 [2018-12-09 03:06:02,314 INFO L226 Difference]: Without dead ends: 488 [2018-12-09 03:06:02,315 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-09 03:06:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-09 03:06:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2018-12-09 03:06:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-09 03:06:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 670 transitions. [2018-12-09 03:06:02,339 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 670 transitions. Word has length 161 [2018-12-09 03:06:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 670 transitions. [2018-12-09 03:06:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 670 transitions. [2018-12-09 03:06:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 03:06:02,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:02,339 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] [2018-12-09 03:06:02,340 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:02,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1155751515, now seen corresponding path program 1 times [2018-12-09 03:06:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:02,379 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-09 03:06:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:02,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:02,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:02,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:02,380 INFO L87 Difference]: Start difference. First operand 452 states and 670 transitions. Second operand 4 states. [2018-12-09 03:06:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:02,594 INFO L93 Difference]: Finished difference Result 906 states and 1349 transitions. [2018-12-09 03:06:02,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:02,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-09 03:06:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:02,595 INFO L225 Difference]: With dead ends: 906 [2018-12-09 03:06:02,595 INFO L226 Difference]: Without dead ends: 479 [2018-12-09 03:06:02,596 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-09 03:06:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-09 03:06:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 414. [2018-12-09 03:06:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-12-09 03:06:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 614 transitions. [2018-12-09 03:06:02,639 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 614 transitions. Word has length 162 [2018-12-09 03:06:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:02,640 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 614 transitions. [2018-12-09 03:06:02,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 614 transitions. [2018-12-09 03:06:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 03:06:02,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:02,641 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] [2018-12-09 03:06:02,641 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:02,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1196295291, now seen corresponding path program 1 times [2018-12-09 03:06:02,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:02,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:02,689 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-09 03:06:02,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:02,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:02,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:02,690 INFO L87 Difference]: Start difference. First operand 414 states and 614 transitions. Second operand 4 states. [2018-12-09 03:06:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:02,892 INFO L93 Difference]: Finished difference Result 868 states and 1292 transitions. [2018-12-09 03:06:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:02,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-09 03:06:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:02,892 INFO L225 Difference]: With dead ends: 868 [2018-12-09 03:06:02,892 INFO L226 Difference]: Without dead ends: 479 [2018-12-09 03:06:02,893 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-09 03:06:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-12-09 03:06:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 444. [2018-12-09 03:06:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-09 03:06:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 659 transitions. [2018-12-09 03:06:02,917 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 659 transitions. Word has length 164 [2018-12-09 03:06:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:02,918 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 659 transitions. [2018-12-09 03:06:02,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 659 transitions. [2018-12-09 03:06:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 03:06:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:02,918 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] [2018-12-09 03:06:02,918 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:02,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1445304432, now seen corresponding path program 1 times [2018-12-09 03:06:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:02,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:02,953 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-09 03:06:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:02,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:02,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:02,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:02,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:02,954 INFO L87 Difference]: Start difference. First operand 444 states and 659 transitions. Second operand 4 states. [2018-12-09 03:06:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:03,177 INFO L93 Difference]: Finished difference Result 902 states and 1342 transitions. [2018-12-09 03:06:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:03,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-09 03:06:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:03,178 INFO L225 Difference]: With dead ends: 902 [2018-12-09 03:06:03,178 INFO L226 Difference]: Without dead ends: 483 [2018-12-09 03:06:03,178 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-09 03:06:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-09 03:06:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2018-12-09 03:06:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-09 03:06:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 658 transitions. [2018-12-09 03:06:03,203 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 658 transitions. Word has length 164 [2018-12-09 03:06:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:03,204 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 658 transitions. [2018-12-09 03:06:03,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 658 transitions. [2018-12-09 03:06:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 03:06:03,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:03,204 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] [2018-12-09 03:06:03,204 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:03,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1626017385, now seen corresponding path program 1 times [2018-12-09 03:06:03,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:03,239 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-09 03:06:03,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:03,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:03,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:03,240 INFO L87 Difference]: Start difference. First operand 444 states and 658 transitions. Second operand 4 states. [2018-12-09 03:06:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:03,410 INFO L93 Difference]: Finished difference Result 876 states and 1306 transitions. [2018-12-09 03:06:03,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:03,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-09 03:06:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:03,411 INFO L225 Difference]: With dead ends: 876 [2018-12-09 03:06:03,411 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 03:06:03,411 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-09 03:06:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 03:06:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 444. [2018-12-09 03:06:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-09 03:06:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 657 transitions. [2018-12-09 03:06:03,437 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 657 transitions. Word has length 165 [2018-12-09 03:06:03,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:03,437 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 657 transitions. [2018-12-09 03:06:03,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 657 transitions. [2018-12-09 03:06:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-09 03:06:03,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:03,438 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] [2018-12-09 03:06:03,438 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:03,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:03,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1424241049, now seen corresponding path program 1 times [2018-12-09 03:06:03,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:03,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:03,498 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-09 03:06:03,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:03,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:03,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:03,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:03,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:03,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:03,499 INFO L87 Difference]: Start difference. First operand 444 states and 657 transitions. Second operand 4 states. [2018-12-09 03:06:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:03,735 INFO L93 Difference]: Finished difference Result 902 states and 1338 transitions. [2018-12-09 03:06:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:03,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-09 03:06:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:03,736 INFO L225 Difference]: With dead ends: 902 [2018-12-09 03:06:03,736 INFO L226 Difference]: Without dead ends: 483 [2018-12-09 03:06:03,736 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-09 03:06:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-09 03:06:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2018-12-09 03:06:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-09 03:06:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 656 transitions. [2018-12-09 03:06:03,762 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 656 transitions. Word has length 165 [2018-12-09 03:06:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:03,762 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 656 transitions. [2018-12-09 03:06:03,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 656 transitions. [2018-12-09 03:06:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 03:06:03,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:03,763 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] [2018-12-09 03:06:03,763 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:03,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:03,763 INFO L82 PathProgramCache]: Analyzing trace with hash -850493013, now seen corresponding path program 1 times [2018-12-09 03:06:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:03,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:03,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:03,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:03,803 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-09 03:06:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:03,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:03,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:03,804 INFO L87 Difference]: Start difference. First operand 444 states and 656 transitions. Second operand 4 states. [2018-12-09 03:06:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:04,016 INFO L93 Difference]: Finished difference Result 887 states and 1318 transitions. [2018-12-09 03:06:04,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:04,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-09 03:06:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:04,017 INFO L225 Difference]: With dead ends: 887 [2018-12-09 03:06:04,017 INFO L226 Difference]: Without dead ends: 468 [2018-12-09 03:06:04,017 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-09 03:06:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-12-09 03:06:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2018-12-09 03:06:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-09 03:06:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 655 transitions. [2018-12-09 03:06:04,043 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 655 transitions. Word has length 166 [2018-12-09 03:06:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:04,043 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 655 transitions. [2018-12-09 03:06:04,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 655 transitions. [2018-12-09 03:06:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-09 03:06:04,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:04,044 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] [2018-12-09 03:06:04,044 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:04,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash 938734207, now seen corresponding path program 1 times [2018-12-09 03:06:04,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:04,138 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-09 03:06:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:04,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:04,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:04,139 INFO L87 Difference]: Start difference. First operand 444 states and 655 transitions. Second operand 5 states. [2018-12-09 03:06:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:04,479 INFO L93 Difference]: Finished difference Result 939 states and 1399 transitions. [2018-12-09 03:06:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 03:06:04,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2018-12-09 03:06:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:04,480 INFO L225 Difference]: With dead ends: 939 [2018-12-09 03:06:04,480 INFO L226 Difference]: Without dead ends: 520 [2018-12-09 03:06:04,481 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-09 03:06:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-12-09 03:06:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 477. [2018-12-09 03:06:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-09 03:06:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 714 transitions. [2018-12-09 03:06:04,509 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 714 transitions. Word has length 166 [2018-12-09 03:06:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:04,509 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 714 transitions. [2018-12-09 03:06:04,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 714 transitions. [2018-12-09 03:06:04,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 03:06:04,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:04,510 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] [2018-12-09 03:06:04,510 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:04,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 671043978, now seen corresponding path program 1 times [2018-12-09 03:06:04,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:04,544 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-09 03:06:04,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:04,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:04,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:04,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:04,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:04,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:04,545 INFO L87 Difference]: Start difference. First operand 477 states and 714 transitions. Second operand 4 states. [2018-12-09 03:06:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:04,732 INFO L93 Difference]: Finished difference Result 951 states and 1432 transitions. [2018-12-09 03:06:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:04,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 03:06:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:04,733 INFO L225 Difference]: With dead ends: 951 [2018-12-09 03:06:04,733 INFO L226 Difference]: Without dead ends: 499 [2018-12-09 03:06:04,733 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-09 03:06:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-12-09 03:06:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 477. [2018-12-09 03:06:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-09 03:06:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 713 transitions. [2018-12-09 03:06:04,773 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 713 transitions. Word has length 167 [2018-12-09 03:06:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:04,773 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 713 transitions. [2018-12-09 03:06:04,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 713 transitions. [2018-12-09 03:06:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 03:06:04,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:04,774 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] [2018-12-09 03:06:04,774 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:04,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2050751574, now seen corresponding path program 1 times [2018-12-09 03:06:04,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:04,804 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-09 03:06:04,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:04,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:06:04,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:04,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:06:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:06:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:06:04,805 INFO L87 Difference]: Start difference. First operand 477 states and 713 transitions. Second operand 3 states. [2018-12-09 03:06:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:04,870 INFO L93 Difference]: Finished difference Result 1375 states and 2077 transitions. [2018-12-09 03:06:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:06:04,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-12-09 03:06:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:04,871 INFO L225 Difference]: With dead ends: 1375 [2018-12-09 03:06:04,871 INFO L226 Difference]: Without dead ends: 923 [2018-12-09 03:06:04,871 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-09 03:06:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-09 03:06:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-12-09 03:06:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-12-09 03:06:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1385 transitions. [2018-12-09 03:06:04,924 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1385 transitions. Word has length 170 [2018-12-09 03:06:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:04,924 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1385 transitions. [2018-12-09 03:06:04,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:06:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1385 transitions. [2018-12-09 03:06:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 03:06:04,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:04,925 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] [2018-12-09 03:06:04,925 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -633879184, now seen corresponding path program 1 times [2018-12-09 03:06:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:04,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:04,955 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-09 03:06:04,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:04,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:06:04,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:04,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:06:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:06:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:06:04,955 INFO L87 Difference]: Start difference. First operand 923 states and 1385 transitions. Second operand 3 states. [2018-12-09 03:06:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:05,046 INFO L93 Difference]: Finished difference Result 2265 states and 3416 transitions. [2018-12-09 03:06:05,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:06:05,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-12-09 03:06:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:05,048 INFO L225 Difference]: With dead ends: 2265 [2018-12-09 03:06:05,048 INFO L226 Difference]: Without dead ends: 1367 [2018-12-09 03:06:05,049 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-09 03:06:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-09 03:06:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2018-12-09 03:06:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2018-12-09 03:06:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2052 transitions. [2018-12-09 03:06:05,131 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2052 transitions. Word has length 171 [2018-12-09 03:06:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:05,131 INFO L480 AbstractCegarLoop]: Abstraction has 1365 states and 2052 transitions. [2018-12-09 03:06:05,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:06:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2052 transitions. [2018-12-09 03:06:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 03:06:05,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:05,132 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] [2018-12-09 03:06:05,132 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:05,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash 88033091, now seen corresponding path program 1 times [2018-12-09 03:06:05,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:05,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:05,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:05,172 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-09 03:06:05,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:05,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:05,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:05,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:05,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:05,173 INFO L87 Difference]: Start difference. First operand 1365 states and 2052 transitions. Second operand 4 states. [2018-12-09 03:06:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:05,491 INFO L93 Difference]: Finished difference Result 2808 states and 4204 transitions. [2018-12-09 03:06:05,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:05,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-09 03:06:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:05,493 INFO L225 Difference]: With dead ends: 2808 [2018-12-09 03:06:05,493 INFO L226 Difference]: Without dead ends: 1468 [2018-12-09 03:06:05,494 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-09 03:06:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-12-09 03:06:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1275. [2018-12-09 03:06:05,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-12-09 03:06:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1914 transitions. [2018-12-09 03:06:05,576 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1914 transitions. Word has length 171 [2018-12-09 03:06:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:05,576 INFO L480 AbstractCegarLoop]: Abstraction has 1275 states and 1914 transitions. [2018-12-09 03:06:05,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1914 transitions. [2018-12-09 03:06:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 03:06:05,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:05,578 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] [2018-12-09 03:06:05,578 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124408, now seen corresponding path program 1 times [2018-12-09 03:06:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:05,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:05,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:05,624 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-09 03:06:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:05,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:05,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:05,625 INFO L87 Difference]: Start difference. First operand 1275 states and 1914 transitions. Second operand 4 states. [2018-12-09 03:06:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:05,927 INFO L93 Difference]: Finished difference Result 2712 states and 4057 transitions. [2018-12-09 03:06:05,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:05,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-09 03:06:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:05,929 INFO L225 Difference]: With dead ends: 2712 [2018-12-09 03:06:05,929 INFO L226 Difference]: Without dead ends: 1462 [2018-12-09 03:06:05,929 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-09 03:06:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2018-12-09 03:06:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1368. [2018-12-09 03:06:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-09 03:06:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2052 transitions. [2018-12-09 03:06:06,009 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2052 transitions. Word has length 172 [2018-12-09 03:06:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:06,010 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2052 transitions. [2018-12-09 03:06:06,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2052 transitions. [2018-12-09 03:06:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 03:06:06,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:06,010 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-09 03:06:06,011 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:06,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:06,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2065488547, now seen corresponding path program 1 times [2018-12-09 03:06:06,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:06,038 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-09 03:06:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:06:06,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:06,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:06:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:06:06,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:06:06,038 INFO L87 Difference]: Start difference. First operand 1368 states and 2052 transitions. Second operand 3 states. [2018-12-09 03:06:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:06,154 INFO L93 Difference]: Finished difference Result 3126 states and 4706 transitions. [2018-12-09 03:06:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:06:06,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-09 03:06:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:06,156 INFO L225 Difference]: With dead ends: 3126 [2018-12-09 03:06:06,156 INFO L226 Difference]: Without dead ends: 1783 [2018-12-09 03:06:06,156 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-09 03:06:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2018-12-09 03:06:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1779. [2018-12-09 03:06:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2018-12-09 03:06:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2673 transitions. [2018-12-09 03:06:06,264 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2673 transitions. Word has length 172 [2018-12-09 03:06:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 1779 states and 2673 transitions. [2018-12-09 03:06:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:06:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2673 transitions. [2018-12-09 03:06:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 03:06:06,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:06,265 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-09 03:06:06,265 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:06,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1630982949, now seen corresponding path program 1 times [2018-12-09 03:06:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:06,288 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-09 03:06:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:06:06,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:06,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:06:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:06:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:06:06,288 INFO L87 Difference]: Start difference. First operand 1779 states and 2673 transitions. Second operand 3 states. [2018-12-09 03:06:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:06,404 INFO L93 Difference]: Finished difference Result 3560 states and 5355 transitions. [2018-12-09 03:06:06,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:06:06,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-09 03:06:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:06,405 INFO L225 Difference]: With dead ends: 3560 [2018-12-09 03:06:06,405 INFO L226 Difference]: Without dead ends: 1806 [2018-12-09 03:06:06,406 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-09 03:06:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2018-12-09 03:06:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2018-12-09 03:06:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2018-12-09 03:06:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2708 transitions. [2018-12-09 03:06:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2708 transitions. Word has length 172 [2018-12-09 03:06:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:06,520 INFO L480 AbstractCegarLoop]: Abstraction has 1806 states and 2708 transitions. [2018-12-09 03:06:06,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:06:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2708 transitions. [2018-12-09 03:06:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 03:06:06,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:06,521 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-09 03:06:06,521 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:06,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash -732858713, now seen corresponding path program 1 times [2018-12-09 03:06:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:06,543 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-09 03:06:06,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:06,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:06:06,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:06,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:06:06,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:06:06,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:06:06,543 INFO L87 Difference]: Start difference. First operand 1806 states and 2708 transitions. Second operand 3 states. [2018-12-09 03:06:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:06,657 INFO L93 Difference]: Finished difference Result 3589 states and 5391 transitions. [2018-12-09 03:06:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:06:06,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-09 03:06:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:06,659 INFO L225 Difference]: With dead ends: 3589 [2018-12-09 03:06:06,659 INFO L226 Difference]: Without dead ends: 1808 [2018-12-09 03:06:06,660 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-09 03:06:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-12-09 03:06:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2018-12-09 03:06:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-09 03:06:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2710 transitions. [2018-12-09 03:06:06,776 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2710 transitions. Word has length 172 [2018-12-09 03:06:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:06,776 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2710 transitions. [2018-12-09 03:06:06,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:06:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2710 transitions. [2018-12-09 03:06:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 03:06:06,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:06,777 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] [2018-12-09 03:06:06,777 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:06,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -623444499, now seen corresponding path program 1 times [2018-12-09 03:06:06,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:06,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:06,826 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-09 03:06:06,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:06,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:06,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:06,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:06,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:06,827 INFO L87 Difference]: Start difference. First operand 1808 states and 2710 transitions. Second operand 4 states. [2018-12-09 03:06:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:07,246 INFO L93 Difference]: Finished difference Result 3734 states and 5577 transitions. [2018-12-09 03:06:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:07,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-09 03:06:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:07,248 INFO L225 Difference]: With dead ends: 3734 [2018-12-09 03:06:07,249 INFO L226 Difference]: Without dead ends: 1953 [2018-12-09 03:06:07,250 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-09 03:06:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-09 03:06:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-09 03:06:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-09 03:06:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2706 transitions. [2018-12-09 03:06:07,371 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2706 transitions. Word has length 176 [2018-12-09 03:06:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:07,371 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2706 transitions. [2018-12-09 03:06:07,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2706 transitions. [2018-12-09 03:06:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-09 03:06:07,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:07,372 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] [2018-12-09 03:06:07,372 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:07,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1717533628, now seen corresponding path program 1 times [2018-12-09 03:06:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:07,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:07,422 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-09 03:06:07,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:07,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:07,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:07,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:07,422 INFO L87 Difference]: Start difference. First operand 1808 states and 2706 transitions. Second operand 4 states. [2018-12-09 03:06:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:07,795 INFO L93 Difference]: Finished difference Result 3734 states and 5569 transitions. [2018-12-09 03:06:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:07,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-09 03:06:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:07,797 INFO L225 Difference]: With dead ends: 3734 [2018-12-09 03:06:07,797 INFO L226 Difference]: Without dead ends: 1953 [2018-12-09 03:06:07,799 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-09 03:06:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-09 03:06:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-09 03:06:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-09 03:06:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2702 transitions. [2018-12-09 03:06:07,918 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2702 transitions. Word has length 177 [2018-12-09 03:06:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:07,918 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2702 transitions. [2018-12-09 03:06:07,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2702 transitions. [2018-12-09 03:06:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 03:06:07,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:07,919 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] [2018-12-09 03:06:07,920 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:07,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash -348357656, now seen corresponding path program 1 times [2018-12-09 03:06:07,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:07,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:07,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:07,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:07,965 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-09 03:06:07,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:07,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:07,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:07,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:07,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:07,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:07,965 INFO L87 Difference]: Start difference. First operand 1808 states and 2702 transitions. Second operand 4 states. [2018-12-09 03:06:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:08,343 INFO L93 Difference]: Finished difference Result 3734 states and 5561 transitions. [2018-12-09 03:06:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:08,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-09 03:06:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:08,345 INFO L225 Difference]: With dead ends: 3734 [2018-12-09 03:06:08,345 INFO L226 Difference]: Without dead ends: 1953 [2018-12-09 03:06:08,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-09 03:06:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-12-09 03:06:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1808. [2018-12-09 03:06:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-09 03:06:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2698 transitions. [2018-12-09 03:06:08,465 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2698 transitions. Word has length 178 [2018-12-09 03:06:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:08,465 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2698 transitions. [2018-12-09 03:06:08,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2698 transitions. [2018-12-09 03:06:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 03:06:08,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:08,466 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] [2018-12-09 03:06:08,466 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1588247209, now seen corresponding path program 1 times [2018-12-09 03:06:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:08,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:08,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:08,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:08,509 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-09 03:06:08,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:08,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:08,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:08,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:08,510 INFO L87 Difference]: Start difference. First operand 1808 states and 2698 transitions. Second operand 4 states. [2018-12-09 03:06:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:08,860 INFO L93 Difference]: Finished difference Result 3694 states and 5505 transitions. [2018-12-09 03:06:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:08,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-09 03:06:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:08,863 INFO L225 Difference]: With dead ends: 3694 [2018-12-09 03:06:08,863 INFO L226 Difference]: Without dead ends: 1913 [2018-12-09 03:06:08,864 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-09 03:06:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2018-12-09 03:06:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1808. [2018-12-09 03:06:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-12-09 03:06:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2694 transitions. [2018-12-09 03:06:08,983 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2694 transitions. Word has length 179 [2018-12-09 03:06:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:08,983 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2694 transitions. [2018-12-09 03:06:08,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2694 transitions. [2018-12-09 03:06:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-09 03:06:08,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:08,984 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] [2018-12-09 03:06:08,984 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:08,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2016140136, now seen corresponding path program 1 times [2018-12-09 03:06:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:08,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:09,052 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-09 03:06:09,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:09,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:09,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:09,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:09,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:09,053 INFO L87 Difference]: Start difference. First operand 1808 states and 2694 transitions. Second operand 5 states. [2018-12-09 03:06:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:09,548 INFO L93 Difference]: Finished difference Result 4033 states and 6031 transitions. [2018-12-09 03:06:09,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:09,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-12-09 03:06:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:09,550 INFO L225 Difference]: With dead ends: 4033 [2018-12-09 03:06:09,550 INFO L226 Difference]: Without dead ends: 2252 [2018-12-09 03:06:09,551 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-09 03:06:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2018-12-09 03:06:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1967. [2018-12-09 03:06:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 03:06:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2981 transitions. [2018-12-09 03:06:09,673 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2981 transitions. Word has length 181 [2018-12-09 03:06:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:09,673 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 2981 transitions. [2018-12-09 03:06:09,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2981 transitions. [2018-12-09 03:06:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 03:06:09,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:09,674 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] [2018-12-09 03:06:09,674 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:09,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1917662408, now seen corresponding path program 1 times [2018-12-09 03:06:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:09,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:09,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:09,736 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-09 03:06:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:09,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:09,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:09,736 INFO L87 Difference]: Start difference. First operand 1967 states and 2981 transitions. Second operand 5 states. [2018-12-09 03:06:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:10,208 INFO L93 Difference]: Finished difference Result 4304 states and 6538 transitions. [2018-12-09 03:06:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:10,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2018-12-09 03:06:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:10,210 INFO L225 Difference]: With dead ends: 4304 [2018-12-09 03:06:10,210 INFO L226 Difference]: Without dead ends: 2364 [2018-12-09 03:06:10,212 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-09 03:06:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2018-12-09 03:06:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2075. [2018-12-09 03:06:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-12-09 03:06:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3201 transitions. [2018-12-09 03:06:10,336 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3201 transitions. Word has length 182 [2018-12-09 03:06:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:10,337 INFO L480 AbstractCegarLoop]: Abstraction has 2075 states and 3201 transitions. [2018-12-09 03:06:10,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3201 transitions. [2018-12-09 03:06:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 03:06:10,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:10,338 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] [2018-12-09 03:06:10,338 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:10,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2038858637, now seen corresponding path program 1 times [2018-12-09 03:06:10,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:10,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:10,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:10,381 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-09 03:06:10,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:10,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:10,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:10,381 INFO L87 Difference]: Start difference. First operand 2075 states and 3201 transitions. Second operand 4 states. [2018-12-09 03:06:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:10,714 INFO L93 Difference]: Finished difference Result 4208 states and 6491 transitions. [2018-12-09 03:06:10,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:10,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-12-09 03:06:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:10,717 INFO L225 Difference]: With dead ends: 4208 [2018-12-09 03:06:10,717 INFO L226 Difference]: Without dead ends: 2160 [2018-12-09 03:06:10,718 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-09 03:06:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2018-12-09 03:06:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2075. [2018-12-09 03:06:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-12-09 03:06:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3197 transitions. [2018-12-09 03:06:10,842 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3197 transitions. Word has length 194 [2018-12-09 03:06:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:10,843 INFO L480 AbstractCegarLoop]: Abstraction has 2075 states and 3197 transitions. [2018-12-09 03:06:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3197 transitions. [2018-12-09 03:06:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-09 03:06:10,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:10,844 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] [2018-12-09 03:06:10,844 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:10,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash -909303882, now seen corresponding path program 1 times [2018-12-09 03:06:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:10,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 03:06:11,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:11,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:06:11,450 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-09 03:06:11,451 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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:06:11,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:06:11,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:06:12,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:06:12,045 INFO L272 AbstractInterpreter]: Visited 83 different actions 349 times. Merged at 68 different actions 245 times. Never widened. Performed 2761 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2761 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 13 different actions. Largest state had 137 variables. [2018-12-09 03:06:12,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:12,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:06:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:12,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:06:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:12,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:06:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:12,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:06:12,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,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, 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-09 03:06:12,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,234 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-09 03:06:12,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,259 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-09 03:06:12,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,291 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-09 03:06:12,293 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-09 03:06:12,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,296 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-09 03:06:12,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,300 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-09 03:06:12,301 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,307 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,310 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,322 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-09 03:06:12,323 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 03:06:12,368 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-09 03:06:12,370 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-09 03:06:12,388 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-09 03:06:12,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,396 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-09 03:06:12,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,424 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-09 03:06:12,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,432 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-09 03:06:12,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,446 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-09 03:06:12,447 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,472 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,479 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 03:06:12,501 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-09 03:06:12,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,508 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-09 03:06:12,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:12,534 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-09 03:06:12,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,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-09 03:06:12,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:12,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 98 treesize of output 77 [2018-12-09 03:06:12,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-09 03:06:12,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,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 98 treesize of output 77 [2018-12-09 03:06:12,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,603 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-09 03:06:12,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:06:12,625 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-09 03:06:12,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,631 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-09 03:06:12,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:12,669 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-09 03:06:12,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,677 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-09 03:06:12,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:12,710 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-09 03:06:12,715 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-09 03:06:12,730 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-09 03:06:12,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,741 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-09 03:06:12,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:12,758 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-09 03:06:12,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,794 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:06:12,802 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-09 03:06:12,805 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-09 03:06:12,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,829 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-09 03:06:12,831 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-09 03:06:12,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,852 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-09 03:06:12,854 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-09 03:06:12,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,863 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:208, output treesize:100 [2018-12-09 03:06:12,894 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-09 03:06:12,896 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-09 03:06:12,896 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-09 03:06:12,899 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-09 03:06:12,910 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-09 03:06:12,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 15 treesize of output 3 [2018-12-09 03:06:12,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:12,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:82 [2018-12-09 03:06:13,030 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-09 03:06:13,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:06:13,036 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-09 03:06:13,038 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-09 03:06:13,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2018-12-09 03:06:13,099 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-09 03:06:13,105 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-09 03:06:13,107 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-09 03:06:13,113 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-09 03:06:13,127 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-09 03:06:13,132 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-09 03:06:13,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-09 03:06:13,137 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-09 03:06:13,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:13,151 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:13,151 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-09 03:06:13,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:13,155 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-09 03:06:13,155 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,167 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-09 03:06:13,168 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-09 03:06:13,169 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,171 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,175 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-09 03:06:13,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:13,179 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-09 03:06:13,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:13,182 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-09 03:06:13,182 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:13,191 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-09 03:06:13,193 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-09 03:06:13,193 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,196 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,199 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-09 03:06:13,208 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-09 03:06:13,209 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-09 03:06:13,209 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,212 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,213 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-09 03:06:13,214 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-09 03:06:13,215 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,216 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:13,221 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-09 03:06:13,221 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2018-12-09 03:06:13,274 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-09 03:06:13,276 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-09 03:06:13,282 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-09 03:06:13,285 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-09 03:06:13,288 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-09 03:06:13,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:20 [2018-12-09 03:06:13,785 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-09 03:06:13,787 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-09 03:06:13,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:13,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-09 03:06:14,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:14,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:14,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:14,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:20 [2018-12-09 03:06:14,281 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-09 03:06:14,285 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-09 03:06:14,289 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-09 03:06:14,291 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-09 03:06:14,292 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-09 03:06:14,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:30 [2018-12-09 03:06:14,784 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-09 03:06:14,786 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-09 03:06:14,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:14,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-09 03:06:15,288 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-09 03:06:15,291 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-09 03:06:15,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:15,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-09 03:06:15,802 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-09 03:06:15,805 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-09 03:06:15,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:15,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:15,818 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-09 03:06:15,819 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-09 03:06:15,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:15,821 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:81, output treesize:30 [2018-12-09 03:06:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 47 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-09 03:06:15,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 03:06:15,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 8] total 27 [2018-12-09 03:06:15,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:15,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 03:06:15,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 03:06:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=622, Unknown=1, NotChecked=0, Total=702 [2018-12-09 03:06:15,924 INFO L87 Difference]: Start difference. First operand 2075 states and 3197 transitions. Second operand 7 states. [2018-12-09 03:06:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:17,022 INFO L93 Difference]: Finished difference Result 6147 states and 9483 transitions. [2018-12-09 03:06:17,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:06:17,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-12-09 03:06:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:17,028 INFO L225 Difference]: With dead ends: 6147 [2018-12-09 03:06:17,028 INFO L226 Difference]: Without dead ends: 4099 [2018-12-09 03:06:17,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 378 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=97, Invalid=714, Unknown=1, NotChecked=0, Total=812 [2018-12-09 03:06:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-12-09 03:06:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2083. [2018-12-09 03:06:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2018-12-09 03:06:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3205 transitions. [2018-12-09 03:06:17,192 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3205 transitions. Word has length 195 [2018-12-09 03:06:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:17,192 INFO L480 AbstractCegarLoop]: Abstraction has 2083 states and 3205 transitions. [2018-12-09 03:06:17,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 03:06:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3205 transitions. [2018-12-09 03:06:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-09 03:06:17,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:17,194 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] [2018-12-09 03:06:17,194 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:17,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1019606890, now seen corresponding path program 1 times [2018-12-09 03:06:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:17,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:17,446 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-09 03:06:17,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:17,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:06:17,446 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-12-09 03:06:17,446 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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:06:17,448 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:06:17,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:06:17,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:06:17,665 INFO L272 AbstractInterpreter]: Visited 83 different actions 219 times. Merged at 66 different actions 126 times. Never widened. Performed 1623 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1623 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-09 03:06:17,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:17,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:06:17,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:17,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:06:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:17,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:06:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:17,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:06:17,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,765 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-09 03:06:17,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,780 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-09 03:06:17,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,796 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-09 03:06:17,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,820 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-09 03:06:17,821 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-09 03:06:17,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,823 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-09 03:06:17,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,827 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-09 03:06:17,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,855 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-09 03:06:17,855 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 03:06:17,893 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-09 03:06:17,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,905 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-09 03:06:17,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,946 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-09 03:06:17,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,953 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-09 03:06:17,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,978 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-09 03:06:17,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:17,985 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-09 03:06:17,985 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:17,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,004 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 03:06:18,019 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-09 03:06:18,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,025 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-09 03:06:18,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:18,046 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-09 03:06:18,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,054 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-09 03:06:18,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:18,073 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-09 03:06:18,075 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-09 03:06:18,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 103 treesize of output 82 [2018-12-09 03:06:18,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,096 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-09 03:06:18,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,109 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-09 03:06:18,109 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:06:18,147 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-09 03:06:18,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,153 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-09 03:06:18,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:18,176 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-09 03:06:18,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,181 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-09 03:06:18,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:06:18,205 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-09 03:06:18,208 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-09 03:06: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 103 treesize of output 82 [2018-12-09 03:06:18,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,229 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-09 03:06:18,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,241 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-09 03:06:18,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,273 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:06:18,277 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-09 03:06:18,279 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-09 03:06:18,279 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-09 03:06:18,281 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-09 03:06:18,292 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-09 03:06:18,293 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-09 03:06:18,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:06:18,307 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-09 03:06:18,309 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-09 03:06:18,323 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-09 03:06:18,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,333 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-09 03:06:18,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,345 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-09 03:06:18,345 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,380 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:06:18,384 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-09 03:06:18,385 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-09 03:06:18,385 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-09 03:06:18,387 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-09 03:06:18,399 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-09 03:06:18,400 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-09 03:06:18,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:06:18,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2018-12-09 03:06:18,433 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-09 03:06:18,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,459 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-09 03:06:18,462 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-09 03:06:18,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,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 44 treesize of output 49 [2018-12-09 03:06:18,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,495 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-09 03:06:18,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,509 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,519 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-09 03:06:18,529 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-09 03:06:18,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,582 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-09 03:06:18,584 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-09 03:06:18,585 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,593 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,625 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-09 03:06:18,634 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-09 03:06:18,663 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-09 03:06:18,667 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-09 03:06:18,699 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-09 03:06:18,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,726 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-09 03:06:18,727 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,761 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-09 03:06:18,764 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-09 03:06:18,764 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,787 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-09 03:06:18,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,801 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-09 03:06:18,801 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,827 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,842 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-09 03:06:18,854 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-09 03:06:18,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-09 03:06:18,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,877 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-09 03:06:18,877 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,882 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,895 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-09 03:06:18,919 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-09 03:06:18,921 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-09 03:06:18,922 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-09 03:06:18,926 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-09 03:06:18,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,944 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-09 03:06:18,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:18,949 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-09 03:06:18,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:18,967 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-09 03:06:18,969 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-09 03:06:18,970 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-09 03:06:18,976 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-09 03:06:18,980 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-09 03:06:18,980 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-09 03:06:19,172 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-09 03:06:19,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:06:19,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:19,257 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-09 03:06:19,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:19,264 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-09 03:06:19,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,297 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-09 03:06:19,302 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-09 03:06:19,319 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-09 03:06:19,332 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-09 03:06:19,349 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-09 03:06:19,352 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-09 03:06:19,362 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-09 03:06:19,365 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-09 03:06:19,374 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-09 03:06:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 187 [2018-12-09 03:06:19,378 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-09 03:06:19,381 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-09 03:06:19,392 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-09 03:06:19,394 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-09 03:06:19,394 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,402 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-09 03:06:19,417 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,417 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,418 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-09 03:06:19,418 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,433 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-09 03:06:19,435 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-09 03:06:19,435 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,441 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,441 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-09 03:06:19,441 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,444 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,451 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-09 03:06:19,453 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 107 treesize of output 99 [2018-12-09 03:06:19,453 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,466 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,466 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 99 treesize of output 90 [2018-12-09 03:06:19,466 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,476 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,478 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,478 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:19,478 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-09 03:06:19,478 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:19,487 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:19,494 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-09 03:06:19,499 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-09 03:06:19,507 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-09 03:06:19,507 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:109 [2018-12-09 03:06:19,513 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-09 03:06:19,515 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-09 03:06:19,518 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-09 03:06:19,519 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-09 03:06:19,519 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-09 03:06:19,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-09 03:06:19,522 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-09 03:06:19,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-09 03:06:19,530 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-09 03:06:19,531 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-09 03:06:19,542 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-09 03:06:19,544 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-09 03:06:19,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:19,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-09 03:06:19,549 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-09 03:06:19,550 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-09 03:06:19,553 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-09 03:06:19,554 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-09 03:06:19,554 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-09 03:06:19,556 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-09 03:06:19,557 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-09 03:06:19,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-09 03:06:19,564 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-09 03:06:19,566 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-09 03:06:19,570 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-09 03:06:19,571 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-09 03:06:19,572 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-09 03:06:19,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-09 03:06:19,576 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-09 03:06:19,577 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-09 03:06:19,579 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-09 03:06:19,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 03:06:19,582 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-09 03:06:19,584 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-09 03:06:19,585 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-09 03:06:19,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 03:06:19,589 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-09 03:06:19,591 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-09 03:06:19,595 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-09 03:06:19,596 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-09 03:06:19,598 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-09 03:06:19,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-09 03:06:19,602 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-09 03:06:19,604 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-09 03:06:19,606 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-09 03:06:19,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 03:06:19,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-09 03:06:19,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-09 03:06:19,614 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-09 03:06:19,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 03:06:19,624 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-09 03:06:19,627 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-09 03:06:19,643 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-09 03:06:19,646 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-09 03:06:19,656 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-09 03:06:19,657 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-09 03:06:19,659 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-09 03:06:19,659 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:20 [2018-12-09 03:06:19,711 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-09 03:06:19,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 03:06:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2018-12-09 03:06:19,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 03:06:19,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 03:06:19,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 03:06:19,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 03:06:19,727 INFO L87 Difference]: Start difference. First operand 2083 states and 3205 transitions. Second operand 14 states. [2018-12-09 03:06:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:23,796 INFO L93 Difference]: Finished difference Result 6876 states and 10458 transitions. [2018-12-09 03:06:23,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 03:06:23,797 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-12-09 03:06:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:23,802 INFO L225 Difference]: With dead ends: 6876 [2018-12-09 03:06:23,802 INFO L226 Difference]: Without dead ends: 4820 [2018-12-09 03:06:23,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 371 SyntacticMatches, 22 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-12-09 03:06:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2018-12-09 03:06:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 2683. [2018-12-09 03:06:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-09 03:06:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4205 transitions. [2018-12-09 03:06:23,995 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4205 transitions. Word has length 195 [2018-12-09 03:06:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4205 transitions. [2018-12-09 03:06:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 03:06:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4205 transitions. [2018-12-09 03:06:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-09 03:06:23,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:23,997 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] [2018-12-09 03:06:23,997 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:23,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash 862439301, now seen corresponding path program 1 times [2018-12-09 03:06:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:23,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:24,056 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-09 03:06:24,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:24,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:24,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:24,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:24,057 INFO L87 Difference]: Start difference. First operand 2683 states and 4205 transitions. Second operand 4 states. [2018-12-09 03:06:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:24,505 INFO L93 Difference]: Finished difference Result 5444 states and 8519 transitions. [2018-12-09 03:06:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:24,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-12-09 03:06:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:24,509 INFO L225 Difference]: With dead ends: 5444 [2018-12-09 03:06:24,509 INFO L226 Difference]: Without dead ends: 2788 [2018-12-09 03:06:24,512 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-09 03:06:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2018-12-09 03:06:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2683. [2018-12-09 03:06:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-09 03:06:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4201 transitions. [2018-12-09 03:06:24,726 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4201 transitions. Word has length 203 [2018-12-09 03:06:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4201 transitions. [2018-12-09 03:06:24,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4201 transitions. [2018-12-09 03:06:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-09 03:06:24,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:24,728 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] [2018-12-09 03:06:24,728 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:24,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash -339942442, now seen corresponding path program 1 times [2018-12-09 03:06:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:24,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:24,779 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-09 03:06:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:24,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:24,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:24,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:24,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:24,780 INFO L87 Difference]: Start difference. First operand 2683 states and 4201 transitions. Second operand 4 states. [2018-12-09 03:06:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:25,207 INFO L93 Difference]: Finished difference Result 5436 states and 8503 transitions. [2018-12-09 03:06:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:25,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-12-09 03:06:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:25,210 INFO L225 Difference]: With dead ends: 5436 [2018-12-09 03:06:25,210 INFO L226 Difference]: Without dead ends: 2780 [2018-12-09 03:06:25,212 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-09 03:06:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2018-12-09 03:06:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2683. [2018-12-09 03:06:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2018-12-09 03:06:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4197 transitions. [2018-12-09 03:06:25,407 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4197 transitions. Word has length 204 [2018-12-09 03:06:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:25,407 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 4197 transitions. [2018-12-09 03:06:25,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4197 transitions. [2018-12-09 03:06:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-09 03:06:25,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:25,408 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] [2018-12-09 03:06:25,409 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:25,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:25,409 INFO L82 PathProgramCache]: Analyzing trace with hash -67549126, now seen corresponding path program 1 times [2018-12-09 03:06:25,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:25,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:25,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:25,494 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-09 03:06:25,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:25,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:06:25,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:25,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:06:25,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:06:25,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:06:25,495 INFO L87 Difference]: Start difference. First operand 2683 states and 4197 transitions. Second operand 6 states. [2018-12-09 03:06:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:26,386 INFO L93 Difference]: Finished difference Result 6222 states and 9689 transitions. [2018-12-09 03:06:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:06:26,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2018-12-09 03:06:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:26,389 INFO L225 Difference]: With dead ends: 6222 [2018-12-09 03:06:26,389 INFO L226 Difference]: Without dead ends: 3566 [2018-12-09 03:06:26,391 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-09 03:06:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2018-12-09 03:06:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 2479. [2018-12-09 03:06:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2018-12-09 03:06:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3869 transitions. [2018-12-09 03:06:26,555 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3869 transitions. Word has length 208 [2018-12-09 03:06:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:26,555 INFO L480 AbstractCegarLoop]: Abstraction has 2479 states and 3869 transitions. [2018-12-09 03:06:26,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:06:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3869 transitions. [2018-12-09 03:06:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-09 03:06:26,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:26,557 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] [2018-12-09 03:06:26,557 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:26,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 895187393, now seen corresponding path program 1 times [2018-12-09 03:06:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:26,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:26,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:26,662 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-09 03:06:26,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:26,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:06:26,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:06:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:06:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:06:26,663 INFO L87 Difference]: Start difference. First operand 2479 states and 3869 transitions. Second operand 6 states. [2018-12-09 03:06:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:27,515 INFO L93 Difference]: Finished difference Result 5498 states and 8521 transitions. [2018-12-09 03:06:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:06:27,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-12-09 03:06:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:27,518 INFO L225 Difference]: With dead ends: 5498 [2018-12-09 03:06:27,518 INFO L226 Difference]: Without dead ends: 3046 [2018-12-09 03:06:27,520 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-09 03:06:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2018-12-09 03:06:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2483. [2018-12-09 03:06:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2483 states. [2018-12-09 03:06:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3865 transitions. [2018-12-09 03:06:27,685 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3865 transitions. Word has length 209 [2018-12-09 03:06:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 2483 states and 3865 transitions. [2018-12-09 03:06:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:06:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3865 transitions. [2018-12-09 03:06:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 03:06:27,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:27,687 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] [2018-12-09 03:06:27,687 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:27,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1056430011, now seen corresponding path program 1 times [2018-12-09 03:06:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:27,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:27,761 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-09 03:06:27,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:27,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:27,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:27,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:27,762 INFO L87 Difference]: Start difference. First operand 2483 states and 3865 transitions. Second operand 5 states. [2018-12-09 03:06:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:28,310 INFO L93 Difference]: Finished difference Result 5464 states and 8506 transitions. [2018-12-09 03:06:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:28,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2018-12-09 03:06:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:28,312 INFO L225 Difference]: With dead ends: 5464 [2018-12-09 03:06:28,312 INFO L226 Difference]: Without dead ends: 3008 [2018-12-09 03:06:28,314 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-09 03:06:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2018-12-09 03:06:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2631. [2018-12-09 03:06:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-12-09 03:06:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4125 transitions. [2018-12-09 03:06:28,482 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4125 transitions. Word has length 215 [2018-12-09 03:06:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:28,482 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 4125 transitions. [2018-12-09 03:06:28,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4125 transitions. [2018-12-09 03:06:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-09 03:06:28,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:28,484 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] [2018-12-09 03:06:28,484 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:28,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -458841397, now seen corresponding path program 1 times [2018-12-09 03:06:28,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:28,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:28,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:28,565 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-09 03:06:28,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:28,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:28,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:28,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:28,566 INFO L87 Difference]: Start difference. First operand 2631 states and 4125 transitions. Second operand 5 states. [2018-12-09 03:06:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:29,194 INFO L93 Difference]: Finished difference Result 5600 states and 8742 transitions. [2018-12-09 03:06:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:29,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2018-12-09 03:06:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:29,198 INFO L225 Difference]: With dead ends: 5600 [2018-12-09 03:06:29,198 INFO L226 Difference]: Without dead ends: 2996 [2018-12-09 03:06:29,200 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-09 03:06:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2018-12-09 03:06:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2623. [2018-12-09 03:06:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2623 states. [2018-12-09 03:06:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4109 transitions. [2018-12-09 03:06:29,372 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4109 transitions. Word has length 216 [2018-12-09 03:06:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 2623 states and 4109 transitions. [2018-12-09 03:06:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4109 transitions. [2018-12-09 03:06:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 03:06:29,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:29,374 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] [2018-12-09 03:06:29,374 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:29,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1538163606, now seen corresponding path program 1 times [2018-12-09 03:06:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:29,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:29,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:29,439 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-09 03:06:29,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:29,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:29,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:29,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:29,440 INFO L87 Difference]: Start difference. First operand 2623 states and 4109 transitions. Second operand 4 states. [2018-12-09 03:06:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:29,876 INFO L93 Difference]: Finished difference Result 5312 states and 8315 transitions. [2018-12-09 03:06:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:29,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-09 03:06:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:29,880 INFO L225 Difference]: With dead ends: 5312 [2018-12-09 03:06:29,880 INFO L226 Difference]: Without dead ends: 2716 [2018-12-09 03:06:29,882 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-09 03:06:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-12-09 03:06:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2623. [2018-12-09 03:06:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2623 states. [2018-12-09 03:06:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 4105 transitions. [2018-12-09 03:06:30,052 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 4105 transitions. Word has length 219 [2018-12-09 03:06:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:30,053 INFO L480 AbstractCegarLoop]: Abstraction has 2623 states and 4105 transitions. [2018-12-09 03:06:30,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 4105 transitions. [2018-12-09 03:06:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-09 03:06:30,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:30,055 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] [2018-12-09 03:06:30,055 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:30,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:30,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1268047661, now seen corresponding path program 1 times [2018-12-09 03:06:30,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:30,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:30,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:30,132 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-09 03:06:30,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:30,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:06:30,133 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-09 03:06:30,133 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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:06:30,136 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:06:30,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:06:30,459 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:06:30,459 INFO L272 AbstractInterpreter]: Visited 95 different actions 322 times. Merged at 76 different actions 205 times. Never widened. Performed 2571 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2571 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-09 03:06:30,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:30,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:06:30,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:30,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:06:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:30,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:06:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:30,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:06:30,582 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-09 03:06:30,583 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-09 03:06:30,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 03:06:30,627 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-09 03:06:30,629 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-09 03:06:30,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-09 03:06:30,633 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-09 03:06:30,635 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-09 03:06:30,636 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-09 03:06:30,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,642 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-09 03:06:30,644 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-09 03:06:30,645 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-09 03:06:30,650 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-09 03:06:30,692 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-09 03:06:30,694 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-09 03:06:30,694 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,703 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-09 03:06:30,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,706 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-09 03:06:30,706 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,709 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,711 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-09 03:06:30,713 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-09 03:06:30,714 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-09 03:06:30,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:30,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,717 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-09 03:06:30,718 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,720 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,722 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,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, 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-09 03:06:30,738 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-09 03:06:30,739 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,771 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-09 03:06:30,771 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 119 [2018-12-09 03:06:30,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,822 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 113 treesize of output 107 [2018-12-09 03:06:30,822 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,843 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-09 03:06:30,844 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,853 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:30,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,884 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-09 03:06:30,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,889 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 77 treesize of output 62 [2018-12-09 03:06:30,889 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:30,909 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 45 [2018-12-09 03:06:30,909 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,916 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,925 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,935 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-09 03:06:30,936 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-09 03:06:30,936 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,937 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,938 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-09 03:06:30,939 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-09 03:06:30,939 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,940 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:30,944 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:06:30,952 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-09 03:06:30,953 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-09 03:06:30,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,959 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-09 03:06:30,960 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-09 03:06:30,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:30,963 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-09 03:06:30,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-09 03:06:30,986 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-09 03:06:30,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:06:31,000 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:31,000 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-09 03:06:31,014 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-09 03:06:31,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 03:06:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-09 03:06:31,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:31,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:06:31,030 INFO L87 Difference]: Start difference. First operand 2623 states and 4105 transitions. Second operand 4 states. [2018-12-09 03:06:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:31,576 INFO L93 Difference]: Finished difference Result 5744 states and 8978 transitions. [2018-12-09 03:06:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:31,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2018-12-09 03:06:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:31,579 INFO L225 Difference]: With dead ends: 5744 [2018-12-09 03:06:31,579 INFO L226 Difference]: Without dead ends: 3148 [2018-12-09 03:06:31,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 443 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-09 03:06:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2018-12-09 03:06:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2687. [2018-12-09 03:06:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-12-09 03:06:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4191 transitions. [2018-12-09 03:06:31,758 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4191 transitions. Word has length 223 [2018-12-09 03:06:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:31,758 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 4191 transitions. [2018-12-09 03:06:31,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4191 transitions. [2018-12-09 03:06:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-09 03:06:31,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:31,760 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] [2018-12-09 03:06:31,760 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:31,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1960528824, now seen corresponding path program 1 times [2018-12-09 03:06:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:31,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:31,831 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-09 03:06:31,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:31,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:06:31,831 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-12-09 03:06:31,831 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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:06:31,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:06:31,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:06:32,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:06:32,144 INFO L272 AbstractInterpreter]: Visited 95 different actions 324 times. Merged at 73 different actions 207 times. Never widened. Performed 2913 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2913 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-09 03:06:32,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:32,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:06:32,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:32,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:06:32,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:32,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:06:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:32,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:06:32,256 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-09 03:06:32,257 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-09 03:06:32,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 03:06:32,287 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-09 03:06:32,289 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-09 03:06:32,289 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-09 03:06:32,294 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-09 03:06:32,296 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-09 03:06:32,298 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-09 03:06:32,298 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-09 03:06:32,302 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-09 03:06:32,304 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-09 03:06:32,305 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-09 03:06:32,305 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,309 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,332 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-09 03:06:32,334 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-09 03:06:32,335 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-09 03:06:32,340 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-09 03:06:32,341 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-09 03:06:32,343 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-09 03:06:32,344 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-09 03:06:32,349 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-09 03:06:32,350 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-09 03:06:32,351 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-09 03:06:32,351 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,353 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,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, 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-09 03:06:32,381 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-09 03:06:32,381 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,389 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-09 03:06:32,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,391 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-09 03:06:32,391 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,393 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,395 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-09 03:06:32,408 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-09 03:06:32,411 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-09 03:06:32,411 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,438 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-09 03:06:32,438 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,481 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-09 03:06:32,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,487 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 47 treesize of output 44 [2018-12-09 03:06:32,488 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,516 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 33 treesize of output 59 [2018-12-09 03:06:32,516 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,531 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:32,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,581 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-09 03:06:32,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,584 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-09 03:06:32,584 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:32,601 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-09 03:06:32,601 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,609 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:32,615 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-09 03:06:32,616 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-09 03:06:32,617 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-09 03:06:32,617 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,618 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:32,624 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:06:32,632 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-09 03:06:32,633 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-09 03:06:32,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,640 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-09 03:06:32,641 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-09 03:06:32,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,647 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-09 03:06:32,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-09 03:06:32,668 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-09 03:06:32,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:06:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:32,679 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-09 03:06:32,694 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-09 03:06:32,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 03:06:32,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-09 03:06:32,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:32,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:06:32,710 INFO L87 Difference]: Start difference. First operand 2687 states and 4191 transitions. Second operand 4 states. [2018-12-09 03:06:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:33,245 INFO L93 Difference]: Finished difference Result 5712 states and 8874 transitions. [2018-12-09 03:06:33,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:33,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-09 03:06:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:33,247 INFO L225 Difference]: With dead ends: 5712 [2018-12-09 03:06:33,248 INFO L226 Difference]: Without dead ends: 3052 [2018-12-09 03:06:33,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 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-09 03:06:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-12-09 03:06:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2687. [2018-12-09 03:06:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2018-12-09 03:06:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 4173 transitions. [2018-12-09 03:06:33,429 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 4173 transitions. Word has length 224 [2018-12-09 03:06:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:33,430 INFO L480 AbstractCegarLoop]: Abstraction has 2687 states and 4173 transitions. [2018-12-09 03:06:33,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 4173 transitions. [2018-12-09 03:06:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-09 03:06:33,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:33,431 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] [2018-12-09 03:06:33,431 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:33,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 570225439, now seen corresponding path program 1 times [2018-12-09 03:06:33,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:33,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:33,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:33,490 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-09 03:06:33,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:33,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:33,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:33,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:33,491 INFO L87 Difference]: Start difference. First operand 2687 states and 4173 transitions. Second operand 4 states. [2018-12-09 03:06:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:33,986 INFO L93 Difference]: Finished difference Result 5477 states and 8474 transitions. [2018-12-09 03:06:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:33,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-09 03:06:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:33,989 INFO L225 Difference]: With dead ends: 5477 [2018-12-09 03:06:33,989 INFO L226 Difference]: Without dead ends: 2817 [2018-12-09 03:06:33,991 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-09 03:06:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2018-12-09 03:06:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2730. [2018-12-09 03:06:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2018-12-09 03:06:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 4224 transitions. [2018-12-09 03:06:34,167 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 4224 transitions. Word has length 224 [2018-12-09 03:06:34,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:34,167 INFO L480 AbstractCegarLoop]: Abstraction has 2730 states and 4224 transitions. [2018-12-09 03:06:34,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 4224 transitions. [2018-12-09 03:06:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-09 03:06:34,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:34,170 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] [2018-12-09 03:06:34,170 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:34,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:34,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1052584702, now seen corresponding path program 1 times [2018-12-09 03:06:34,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:34,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:34,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:34,262 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-09 03:06:34,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:34,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:34,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:34,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:34,263 INFO L87 Difference]: Start difference. First operand 2730 states and 4224 transitions. Second operand 5 states. [2018-12-09 03:06:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:34,881 INFO L93 Difference]: Finished difference Result 5810 states and 8952 transitions. [2018-12-09 03:06:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:34,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2018-12-09 03:06:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:34,884 INFO L225 Difference]: With dead ends: 5810 [2018-12-09 03:06:34,884 INFO L226 Difference]: Without dead ends: 3107 [2018-12-09 03:06:34,886 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-09 03:06:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2018-12-09 03:06:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 2726. [2018-12-09 03:06:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-12-09 03:06:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 4220 transitions. [2018-12-09 03:06:35,063 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 4220 transitions. Word has length 225 [2018-12-09 03:06:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 4220 transitions. [2018-12-09 03:06:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 4220 transitions. [2018-12-09 03:06:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-09 03:06:35,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:35,065 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] [2018-12-09 03:06:35,065 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:35,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -517719115, now seen corresponding path program 1 times [2018-12-09 03:06:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:35,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:35,120 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-09 03:06:35,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:35,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:06:35,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:35,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:06:35,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:06:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:06:35,121 INFO L87 Difference]: Start difference. First operand 2726 states and 4220 transitions. Second operand 4 states. [2018-12-09 03:06:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:35,536 INFO L93 Difference]: Finished difference Result 5526 states and 8533 transitions. [2018-12-09 03:06:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:35,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-09 03:06:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:35,539 INFO L225 Difference]: With dead ends: 5526 [2018-12-09 03:06:35,540 INFO L226 Difference]: Without dead ends: 2819 [2018-12-09 03:06:35,542 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-09 03:06:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2018-12-09 03:06:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2750. [2018-12-09 03:06:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2018-12-09 03:06:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 4248 transitions. [2018-12-09 03:06:35,721 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 4248 transitions. Word has length 225 [2018-12-09 03:06:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:35,721 INFO L480 AbstractCegarLoop]: Abstraction has 2750 states and 4248 transitions. [2018-12-09 03:06:35,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:06:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 4248 transitions. [2018-12-09 03:06:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 03:06:35,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:35,724 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] [2018-12-09 03:06:35,724 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:35,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash 714774066, now seen corresponding path program 1 times [2018-12-09 03:06:35,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:35,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:35,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:35,807 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-09 03:06:35,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:06:35,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:06:35,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:06:35,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:06:35,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:06:35,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:06:35,808 INFO L87 Difference]: Start difference. First operand 2750 states and 4248 transitions. Second operand 5 states. [2018-12-09 03:06:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:06:36,440 INFO L93 Difference]: Finished difference Result 5831 states and 8978 transitions. [2018-12-09 03:06:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:06:36,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 226 [2018-12-09 03:06:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:06:36,443 INFO L225 Difference]: With dead ends: 5831 [2018-12-09 03:06:36,443 INFO L226 Difference]: Without dead ends: 3100 [2018-12-09 03:06:36,446 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-09 03:06:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-12-09 03:06:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2731. [2018-12-09 03:06:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-09 03:06:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 4227 transitions. [2018-12-09 03:06:36,627 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 4227 transitions. Word has length 226 [2018-12-09 03:06:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:06:36,628 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 4227 transitions. [2018-12-09 03:06:36,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:06:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 4227 transitions. [2018-12-09 03:06:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 03:06:36,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:06:36,630 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] [2018-12-09 03:06:36,630 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:06:36,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:06:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash -246919567, now seen corresponding path program 2 times [2018-12-09 03:06:36,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:06:36,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:36,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:06:36,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:06:36,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:06:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:06:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 59 proven. 382 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 03:06:37,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:37,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:06:37,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 03:06:37,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 03:06:37,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:06:37,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:06:37,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 03:06:37,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 03:06:37,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 03:06:37,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 03:06:37,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:06:37,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 19 treesize of output 16 [2018-12-09 03:06:37,818 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-09 03:06:37,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:37,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:37,860 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-09 03:06:37,863 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-09 03:06:37,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:37,893 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-09 03:06:37,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:37,905 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-09 03:06:37,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:37,992 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-09 03:06:37,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:38,098 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-09 03:06:38,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,113 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 50 treesize of output 113 [2018-12-09 03:06:38,113 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:38,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,186 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-09 03:06:38,187 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:38,235 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:06:38,337 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-09 03:06:38,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,343 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-09 03:06:38,343 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:38,355 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:38,442 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-09 03:06:38,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,447 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-09 03:06:38,447 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:38,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:38,490 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-09 03:06:38,491 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:38,539 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:38,578 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-09 03:06:38,611 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-09 03:06:38,656 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-09 03:06:38,658 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-09 03:06:38,720 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-09 03:06:38,745 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-09 03:06:38,745 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:39,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 140 treesize of output 139 [2018-12-09 03:06:39,001 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,196 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-09 03:06:39,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,201 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-09 03:06:39,201 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,212 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,368 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-09 03:06:39,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,378 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-09 03:06:39,378 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,445 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-09 03:06:39,445 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:39,488 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:39,550 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-09 03:06:39,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,554 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-09 03:06:39,555 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,566 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,594 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:39,601 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-09 03:06:39,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,607 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-09 03:06:39,607 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,637 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-09 03:06:39,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,655 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-09 03:06:39,655 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,683 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,710 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,722 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-09 03:06:39,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,731 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-09 03:06:39,731 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,766 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-09 03:06:39,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:39,775 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:39,785 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-09 03:06:39,786 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,802 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:39,823 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,021 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,041 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,042 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,060 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,062 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,079 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,081 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,106 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:40,276 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-09 03:06:40,277 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:40,279 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-09 03:06:40,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,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, 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-09 03:06:40,282 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,286 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,291 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,295 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-09 03:06:40,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,299 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-09 03:06:40,299 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,313 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-09 03:06:40,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,318 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-09 03:06:40,318 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,327 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,334 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-09 03:06:40,337 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-09 03:06:40,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,340 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-09 03:06:40,340 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,352 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-09 03:06:40,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,355 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:40,357 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-09 03:06:40,357 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,361 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,366 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,382 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-09 03:06:40,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, 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-09 03:06:40,393 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:40,454 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-09 03:06:40,455 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,518 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-09 03:06:40,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,522 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-09 03:06:40,522 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,530 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,583 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-09 03:06:40,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,586 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-09 03:06:40,587 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,594 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,597 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-09 03:06:40,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,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, 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-09 03:06:40,605 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,614 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,650 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:40,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 03:06:40,686 INFO L202 ElimStorePlain]: Needed 64 recursive calls to eliminate 6 variables, input treesize:268, output treesize:245 [2018-12-09 03:06:40,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 100 treesize of output 95 [2018-12-09 03:06:40,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:40,770 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-09 03:06:40,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:40,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:41,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,161 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 135 [2018-12-09 03:06:41,164 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:41,164 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 104 [2018-12-09 03:06:41,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:41,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:41,498 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-09 03:06:41,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,507 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-09 03:06:41,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:41,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,572 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-09 03:06:41,573 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 03:06:41,624 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:06:41,943 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-09 03:06:41,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:41,947 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-09 03:06:41,948 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:41,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,229 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 141 treesize of output 126 [2018-12-09 03:06:42,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,234 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 104 treesize of output 108 [2018-12-09 03:06:42,234 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,247 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,474 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-09 03:06:42,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,481 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 116 treesize of output 180 [2018-12-09 03:06:42,481 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,541 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 115 treesize of output 177 [2018-12-09 03:06:42,542 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,582 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:42,801 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-09 03:06:42,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,804 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-09 03:06:42,804 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,812 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,815 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-09 03:06:42,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,818 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-09 03:06:42,819 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,827 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,829 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-09 03:06:42,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:42,832 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-09 03:06:42,832 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:42,840 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,012 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 110 treesize of output 101 [2018-12-09 03:06:43,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,016 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-09 03:06:43,016 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,026 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,029 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 109 treesize of output 102 [2018-12-09 03:06:43,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,033 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-09 03:06:43,033 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,043 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,181 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 86 [2018-12-09 03:06:43,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,185 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-09 03:06:43,185 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,194 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,196 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 81 [2018-12-09 03:06:43,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,200 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 69 treesize of output 67 [2018-12-09 03:06:43,200 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,207 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,322 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-09 03:06:43,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,326 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-09 03:06:43,326 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,333 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 84 [2018-12-09 03:06:43,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,421 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:06:43,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 53 treesize of output 121 [2018-12-09 03:06:43,426 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,439 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,508 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 89 treesize of output 84 [2018-12-09 03:06:43,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,514 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 57 [2018-12-09 03:06:43,514 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,522 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 03:06:43,570 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 12 variables, input treesize:471, output treesize:352 [2018-12-09 03:06:43,640 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-09 03:06:43,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,663 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-09 03:06:43,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-12-09 03:06:43,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,723 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 49 treesize of output 67 [2018-12-09 03:06:43,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 03:06:43,813 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-09 03:06:43,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,829 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-09 03:06:43,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 03:06:43,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:06:43,907 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-09 03:06:43,909 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-09 03:06:43,909 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,923 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-09 03:06:43,923 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,937 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-09 03:06:43,937 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,947 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:43,982 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-09 03:06:43,983 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-09 03:06:43,983 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:43,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:43,998 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-09 03:06:43,998 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,003 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 03:06:44,048 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:393, output treesize:148 [2018-12-09 03:06:44,116 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-09 03:06:44,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:44,119 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-09 03:06:44,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,149 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-09 03:06:44,151 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-09 03:06:44,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,171 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-09 03:06:44,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:44,174 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-09 03:06:44,174 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,191 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-09 03:06:44,192 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-09 03:06:44,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,194 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:44,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:44,202 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-09 03:06:44,205 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-09 03:06:44,258 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-09 03:06:45,150 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 269 treesize of output 235 [2018-12-09 03:06:45,154 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-09 03:06:45,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:45,218 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 164 treesize of output 161 [2018-12-09 03:06:45,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:45,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 151 treesize of output 153 [2018-12-09 03:06:45,227 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:45,244 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:45,281 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-09 03:06:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 202 [2018-12-09 03:06:45,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:45,966 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 151 treesize of output 153 [2018-12-09 03:06:45,966 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:45,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:46,508 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 196 treesize of output 190 [2018-12-09 03:06:46,512 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-09 03:06:46,512 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:46,538 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:46,950 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-09 03:06:47,056 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-09 03:06:47,415 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:47,429 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:47,699 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:47,780 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:06:48,145 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-09 03:06:48,150 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-09 03:06:48,151 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:50,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:50,834 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-09 03:06:50,835 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:53,619 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 303 treesize of output 234 [2018-12-09 03:06:53,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,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, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 221 [2018-12-09 03:06:53,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:53,672 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 210 treesize of output 352 [2018-12-09 03:06:53,672 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:53,701 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:53,747 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:55,568 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 246 treesize of output 254 [2018-12-09 03:06:55,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:55,577 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 237 treesize of output 247 [2018-12-09 03:06:55,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:55,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:55,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:55,595 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-09 03:06:55,595 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:55,659 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,150 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,326 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-09 03:06:56,499 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 118 [2018-12-09 03:06:56,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,504 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 115 treesize of output 125 [2018-12-09 03:06:56,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,512 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 117 treesize of output 139 [2018-12-09 03:06:56,513 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,523 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,532 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,692 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 118 treesize of output 84 [2018-12-09 03:06:56,694 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-09 03:06:56,694 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,708 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-09 03:06:56,709 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-09 03:06:56,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:56,713 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-09 03:06:56,713 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,717 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,722 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,730 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:56,845 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-09 03:06:56,888 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-09 03:06:56,982 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-09 03:06:56,986 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-09 03:06:56,986 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,079 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,127 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-09 03:06:57,129 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-09 03:06:57,129 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 64 [2018-12-09 03:06:57,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,168 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-09 03:06:57,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,175 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-09 03:06:57,176 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,186 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,200 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-09 03:06:57,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,204 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-09 03:06:57,204 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,211 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,220 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,236 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-09 03:06:57,269 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-09 03:06:57,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,273 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-09 03:06:57,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,280 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-09 03:06:57,280 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,286 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,298 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:57,322 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-09 03:06:57,448 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-09 03:06:57,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,452 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-09 03:06:57,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,491 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-09 03:06:57,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,495 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-09 03:06:57,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,528 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-09 03:06:57,530 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-09 03:06:57,530 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-09 03:06:57,541 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-09 03:06:57,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,576 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-09 03:06:57,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,581 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 110 treesize of output 140 [2018-12-09 03:06:57,581 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,623 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 73 treesize of output 131 [2018-12-09 03:06:57,624 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:06:57,689 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-09 03:06:57,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,692 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-09 03:06:57,692 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,699 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-12-09 03:06:57,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:06:57,704 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-09 03:06:57,705 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,713 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:57,737 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-09 03:06:57,738 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-09 03:06:57,738 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-09 03:06:57,744 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-09 03:06:57,768 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-09 03:06:57,768 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:209, output treesize:185 [2018-12-09 03:06:59,833 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2018-12-09 03:06:59,835 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-09 03:06:59,837 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-09 03:06:59,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:06:59,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:06:59,857 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-09 03:06:59,859 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-09 03:06:59,859 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-09 03:06:59,865 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-09 03:06:59,881 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-09 03:06:59,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:91 [2018-12-09 03:07:00,157 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-09 03:07:00,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:00,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2018-12-09 03:07:00,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-09 03:07:00,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-09 03:07:00,356 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-09 03:07:00,362 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-09 03:07:00,398 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-09 03:07:00,404 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-09 03:07:00,424 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-09 03:07:00,429 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-09 03:07:00,443 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-09 03:07:00,447 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-09 03:07:00,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 99 [2018-12-09 03:07:00,477 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-09 03:07:00,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,502 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,504 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-09 03:07:00,507 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-09 03:07:00,507 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,516 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-09 03:07:00,517 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,519 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:00,523 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-09 03:07:00,526 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,527 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,527 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-09 03:07:00,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:00,543 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-09 03:07:00,543 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,550 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,562 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,575 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-09 03:07:00,593 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:00,599 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:00,599 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,601 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:00,610 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-09 03:07:00,610 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:322, output treesize:206 [2018-12-09 03:07:00,661 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-09 03:07:00,664 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-09 03:07:00,669 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-09 03:07:00,671 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-09 03:07:00,674 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-09 03:07:00,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:93 [2018-12-09 03:07:00,849 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-09 03:07:00,855 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-09 03:07:00,872 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-09 03:07:00,877 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-09 03:07:00,890 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-09 03:07:00,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:116 [2018-12-09 03:07:01,051 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-09 03:07:01,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:01,062 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-09 03:07:01,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:382, output treesize:1 [2018-12-09 03:07:01,179 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-09 03:07:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 03:07:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2018-12-09 03:07:01,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 03:07:01,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 03:07:01,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 03:07:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 03:07:01,196 INFO L87 Difference]: Start difference. First operand 2731 states and 4227 transitions. Second operand 26 states. [2018-12-09 03:07:06,207 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-12-09 03:07:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:13,528 INFO L93 Difference]: Finished difference Result 15508 states and 23434 transitions. [2018-12-09 03:07:13,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 03:07:13,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 237 [2018-12-09 03:07:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:13,537 INFO L225 Difference]: With dead ends: 15508 [2018-12-09 03:07:13,537 INFO L226 Difference]: Without dead ends: 12804 [2018-12-09 03:07:13,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 449 SyntacticMatches, 17 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1023, Invalid=4233, Unknown=0, NotChecked=0, Total=5256 [2018-12-09 03:07:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12804 states. [2018-12-09 03:07:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12804 to 6484. [2018-12-09 03:07:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-09 03:07:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 10363 transitions. [2018-12-09 03:07:14,022 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 10363 transitions. Word has length 237 [2018-12-09 03:07:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:14,023 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 10363 transitions. [2018-12-09 03:07:14,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 03:07:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 10363 transitions. [2018-12-09 03:07:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-09 03:07:14,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:14,025 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] [2018-12-09 03:07:14,025 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:14,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash 337110400, now seen corresponding path program 1 times [2018-12-09 03:07:14,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:14,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:14,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:07:14,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:14,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:14,087 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-09 03:07:14,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:14,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:14,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:14,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:14,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:14,088 INFO L87 Difference]: Start difference. First operand 6484 states and 10363 transitions. Second operand 4 states. [2018-12-09 03:07:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:14,778 INFO L93 Difference]: Finished difference Result 12996 states and 20765 transitions. [2018-12-09 03:07:14,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:14,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-12-09 03:07:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:14,785 INFO L225 Difference]: With dead ends: 12996 [2018-12-09 03:07:14,785 INFO L226 Difference]: Without dead ends: 6539 [2018-12-09 03:07:14,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-09 03:07:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2018-12-09 03:07:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6484. [2018-12-09 03:07:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6484 states. [2018-12-09 03:07:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 10360 transitions. [2018-12-09 03:07:15,257 INFO L78 Accepts]: Start accepts. Automaton has 6484 states and 10360 transitions. Word has length 240 [2018-12-09 03:07:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:15,257 INFO L480 AbstractCegarLoop]: Abstraction has 6484 states and 10360 transitions. [2018-12-09 03:07:15,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states and 10360 transitions. [2018-12-09 03:07:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-09 03:07:15,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:15,260 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] [2018-12-09 03:07:15,261 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:15,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash 68039299, now seen corresponding path program 1 times [2018-12-09 03:07:15,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:15,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:15,347 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-09 03:07:15,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:15,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:07:15,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:15,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:07:15,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:07:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:07:15,348 INFO L87 Difference]: Start difference. First operand 6484 states and 10360 transitions. Second operand 5 states. [2018-12-09 03:07:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:16,354 INFO L93 Difference]: Finished difference Result 14080 states and 22449 transitions. [2018-12-09 03:07:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:16,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2018-12-09 03:07:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:16,361 INFO L225 Difference]: With dead ends: 14080 [2018-12-09 03:07:16,362 INFO L226 Difference]: Without dead ends: 7623 [2018-12-09 03:07:16,366 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-09 03:07:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2018-12-09 03:07:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 6904. [2018-12-09 03:07:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2018-12-09 03:07:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 11056 transitions. [2018-12-09 03:07:16,844 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 11056 transitions. Word has length 247 [2018-12-09 03:07:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:16,844 INFO L480 AbstractCegarLoop]: Abstraction has 6904 states and 11056 transitions. [2018-12-09 03:07:16,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:07:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 11056 transitions. [2018-12-09 03:07:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-09 03:07:16,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:16,846 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] [2018-12-09 03:07:16,846 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:16,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash -224677325, now seen corresponding path program 1 times [2018-12-09 03:07:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:16,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:16,910 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-09 03:07:16,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:16,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:16,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:16,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:16,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:16,910 INFO L87 Difference]: Start difference. First operand 6904 states and 11056 transitions. Second operand 4 states. [2018-12-09 03:07:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:17,843 INFO L93 Difference]: Finished difference Result 14255 states and 22780 transitions. [2018-12-09 03:07:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:17,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2018-12-09 03:07:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:17,851 INFO L225 Difference]: With dead ends: 14255 [2018-12-09 03:07:17,851 INFO L226 Difference]: Without dead ends: 7378 [2018-12-09 03:07:17,857 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-09 03:07:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2018-12-09 03:07:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 6904. [2018-12-09 03:07:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2018-12-09 03:07:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 11048 transitions. [2018-12-09 03:07:18,338 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 11048 transitions. Word has length 248 [2018-12-09 03:07:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:18,338 INFO L480 AbstractCegarLoop]: Abstraction has 6904 states and 11048 transitions. [2018-12-09 03:07:18,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 11048 transitions. [2018-12-09 03:07:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-09 03:07:18,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:18,341 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] [2018-12-09 03:07:18,341 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:18,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2051544954, now seen corresponding path program 1 times [2018-12-09 03:07:18,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:18,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:18,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:18,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-09 03:07:18,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:18,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:07:18,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:18,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:07:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:07:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:07:18,436 INFO L87 Difference]: Start difference. First operand 6904 states and 11048 transitions. Second operand 5 states. [2018-12-09 03:07:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:19,454 INFO L93 Difference]: Finished difference Result 14456 states and 23033 transitions. [2018-12-09 03:07:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:19,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2018-12-09 03:07:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:19,462 INFO L225 Difference]: With dead ends: 14456 [2018-12-09 03:07:19,462 INFO L226 Difference]: Without dead ends: 7579 [2018-12-09 03:07:19,467 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-09 03:07:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2018-12-09 03:07:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 6872. [2018-12-09 03:07:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-09 03:07:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10980 transitions. [2018-12-09 03:07:19,965 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10980 transitions. Word has length 249 [2018-12-09 03:07:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:19,965 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10980 transitions. [2018-12-09 03:07:19,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:07:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10980 transitions. [2018-12-09 03:07:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-09 03:07:19,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:19,968 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] [2018-12-09 03:07:19,968 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:19,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -328379941, now seen corresponding path program 1 times [2018-12-09 03:07:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:19,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 192 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-09 03:07:20,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:20,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:20,405 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2018-12-09 03:07:20,405 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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:20,407 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:20,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:20,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:20,654 INFO L272 AbstractInterpreter]: Visited 95 different actions 322 times. Merged at 76 different actions 205 times. Never widened. Performed 2595 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2595 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-09 03:07:20,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:20,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:20,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:20,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:07:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:20,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:20,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:20,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,793 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-09 03:07:20,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,806 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-09 03:07:20,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,822 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-09 03:07:20,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,828 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,844 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-09 03:07:20,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, 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-09 03:07:20,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,847 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-09 03:07:20,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,851 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-09 03:07:20,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,871 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-09 03:07:20,871 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 03:07:20,901 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-09 03:07:20,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,911 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-09 03:07:20,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,943 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-09 03:07:20,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,951 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-09 03:07:20,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,975 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-09 03:07:20,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:20,982 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-09 03:07:20,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:20,998 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 03:07:21,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-09 03:07:21,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,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, 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-09 03:07:21,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:21,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 98 treesize of output 77 [2018-12-09 03:07:21,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,047 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-09 03:07:21,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:21,065 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-09 03:07:21,067 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-09 03:07:21,079 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-09 03:07:21,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,087 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-09 03:07:21,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,099 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-09 03:07:21,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,114 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,128 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:21,133 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-09 03:07:21,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,140 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-09 03:07:21,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:21,160 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-09 03:07:21,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,166 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-09 03:07:21,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:21,185 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-09 03:07:21,188 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-09 03:07:21,202 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-09 03:07:21,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,209 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-09 03:07:21,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,227 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-09 03:07:21,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,258 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:21,263 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-09 03:07:21,264 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-09 03:07:21,265 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-09 03:07:21,267 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-09 03:07:21,283 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-09 03:07:21,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 28 treesize of output 1 [2018-12-09 03:07:21,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:07:21,307 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-09 03:07:21,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,314 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-09 03:07:21,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,338 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-09 03:07:21,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,343 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-09 03:07:21,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:21,363 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-09 03:07:21,365 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-09 03:07:21,365 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-09 03:07:21,366 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-09 03:07:21,378 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-09 03:07:21,379 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-09 03:07:21,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:07:21,396 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-09 03:07:21,413 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-09 03:07:21,462 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-09 03:07:21,467 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-09 03:07:21,522 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-09 03:07:21,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,579 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-09 03:07:21,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,653 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-09 03:07:21,656 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-09 03:07:21,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,701 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-09 03:07:21,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,732 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-09 03:07:21,733 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,784 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,820 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-09 03:07:21,856 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-09 03:07:21,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, 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-09 03:07:21,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 40 treesize of output 1 [2018-12-09 03:07:21,909 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,919 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,955 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-09 03:07:21,957 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-09 03:07:21,957 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,969 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-09 03:07:21,971 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-09 03:07:21,971 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,983 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-09 03:07:21,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:21,987 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-09 03:07:21,987 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:21,999 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,004 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-09 03:07:22,009 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-09 03:07:22,027 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-09 03:07:22,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,032 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-09 03:07:22,032 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,037 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,050 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-09 03:07:22,081 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-09 03:07:22,083 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-09 03:07:22,083 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-09 03:07:22,087 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-09 03:07:22,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,104 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-09 03:07:22,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,108 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-09 03:07:22,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,127 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-09 03:07:22,129 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-09 03:07:22,129 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-09 03:07:22,135 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-09 03:07:22,139 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-09 03:07:22,139 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-09 03:07:22,157 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-09 03:07:22,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-09 03:07:22,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,165 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-09 03:07:22,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,169 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-09 03:07:22,169 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-09 03:07:22,354 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-09 03:07:22,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:22,408 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-09 03:07:22,412 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-09 03:07:22,438 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-09 03:07:22,454 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-09 03:07:22,481 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-09 03:07:22,486 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-09 03:07:22,504 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-09 03:07:22,508 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-09 03:07:22,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,526 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-09 03:07:22,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:22,531 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-09 03:07:22,531 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,538 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,545 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-09 03:07:22,547 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-09 03:07:22,547 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,556 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-09 03:07:22,571 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,572 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,572 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-09 03:07:22,572 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,586 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-09 03:07:22,587 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,588 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,588 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-09 03:07:22,588 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,597 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-09 03:07:22,598 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,599 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,606 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-09 03:07:22,608 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,608 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,609 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-09 03:07:22,609 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,621 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:22,624 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-09 03:07:22,624 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,642 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-09 03:07:22,642 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,651 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:22,659 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-09 03:07:22,664 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-09 03:07:22,674 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-09 03:07:22,678 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-09 03:07:22,679 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,679 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:22,680 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-09 03:07:22,681 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:15 [2018-12-09 03:07:22,694 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-09 03:07:22,696 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-09 03:07:22,696 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-09 03:07:22,698 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-09 03:07:22,702 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-09 03:07:22,703 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-09 03:07:22,705 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-09 03:07:22,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 03:07:22,731 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-09 03:07:22,733 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-09 03:07:22,741 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-09 03:07:22,742 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-09 03:07:22,744 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-09 03:07:22,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 03:07:22,758 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-09 03:07:22,760 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-09 03:07:22,763 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-09 03:07:22,764 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-09 03:07:22,764 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-09 03:07:22,766 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-09 03:07:22,768 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-09 03:07:22,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 03:07:22,792 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-09 03:07:22,794 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-09 03:07:22,801 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-09 03:07:22,803 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-09 03:07:22,804 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-09 03:07:22,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 03:07:22,824 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-09 03:07:22,825 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-09 03:07:22,826 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-09 03:07:22,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:22,842 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-09 03:07:22,843 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-09 03:07:22,844 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-09 03:07:22,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:22,858 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-09 03:07:22,860 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-09 03:07:22,868 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-09 03:07:22,870 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-09 03:07:22,871 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-09 03:07:22,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 03:07:22,889 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-09 03:07:22,890 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-09 03:07:22,891 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-09 03:07:22,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:22,908 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-09 03:07:22,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-09 03:07:22,910 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-09 03:07:22,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:22,925 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-09 03:07:22,927 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-09 03:07:22,933 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-09 03:07:22,935 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-09 03:07:22,942 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-09 03:07:22,943 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-09 03:07:22,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:22,944 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-09 03:07:23,069 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-09 03:07:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 03:07:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-12-09 03:07:23,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 03:07:23,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 03:07:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 03:07:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-12-09 03:07:23,085 INFO L87 Difference]: Start difference. First operand 6872 states and 10980 transitions. Second operand 16 states. [2018-12-09 03:07:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:27,293 INFO L93 Difference]: Finished difference Result 18254 states and 28686 transitions. [2018-12-09 03:07:27,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:07:27,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 251 [2018-12-09 03:07:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:27,303 INFO L225 Difference]: With dead ends: 18254 [2018-12-09 03:07:27,303 INFO L226 Difference]: Without dead ends: 11409 [2018-12-09 03:07:27,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 484 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-12-09 03:07:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11409 states. [2018-12-09 03:07:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11409 to 6872. [2018-12-09 03:07:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-09 03:07:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10960 transitions. [2018-12-09 03:07:27,825 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10960 transitions. Word has length 251 [2018-12-09 03:07:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10960 transitions. [2018-12-09 03:07:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 03:07:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10960 transitions. [2018-12-09 03:07:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 03:07:27,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:27,828 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] [2018-12-09 03:07:27,829 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:27,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash -665499997, now seen corresponding path program 1 times [2018-12-09 03:07:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:27,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:27,916 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-09 03:07:27,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:27,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:27,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:27,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:27,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:27,917 INFO L87 Difference]: Start difference. First operand 6872 states and 10960 transitions. Second operand 4 states. [2018-12-09 03:07:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:28,626 INFO L93 Difference]: Finished difference Result 13772 states and 21959 transitions. [2018-12-09 03:07:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:28,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2018-12-09 03:07:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:28,632 INFO L225 Difference]: With dead ends: 13772 [2018-12-09 03:07:28,632 INFO L226 Difference]: Without dead ends: 6927 [2018-12-09 03:07:28,637 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-09 03:07:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6927 states. [2018-12-09 03:07:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6927 to 6872. [2018-12-09 03:07:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-09 03:07:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10957 transitions. [2018-12-09 03:07:29,140 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10957 transitions. Word has length 257 [2018-12-09 03:07:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:29,140 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10957 transitions. [2018-12-09 03:07:29,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10957 transitions. [2018-12-09 03:07:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-09 03:07:29,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:29,143 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] [2018-12-09 03:07:29,143 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:29,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1495566504, now seen corresponding path program 1 times [2018-12-09 03:07:29,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:29,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:29,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:29,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:29,195 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-09 03:07:29,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:29,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:29,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:29,196 INFO L87 Difference]: Start difference. First operand 6872 states and 10957 transitions. Second operand 4 states. [2018-12-09 03:07:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:29,908 INFO L93 Difference]: Finished difference Result 13766 states and 21944 transitions. [2018-12-09 03:07:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:29,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-12-09 03:07:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:29,915 INFO L225 Difference]: With dead ends: 13766 [2018-12-09 03:07:29,915 INFO L226 Difference]: Without dead ends: 6921 [2018-12-09 03:07:29,920 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-09 03:07:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6921 states. [2018-12-09 03:07:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6921 to 6872. [2018-12-09 03:07:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6872 states. [2018-12-09 03:07:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10954 transitions. [2018-12-09 03:07:30,426 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10954 transitions. Word has length 258 [2018-12-09 03:07:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:30,426 INFO L480 AbstractCegarLoop]: Abstraction has 6872 states and 10954 transitions. [2018-12-09 03:07:30,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10954 transitions. [2018-12-09 03:07:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-09 03:07:30,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:30,429 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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] [2018-12-09 03:07:30,430 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:30,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 465410482, now seen corresponding path program 1 times [2018-12-09 03:07:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:30,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 354 proven. 229 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-12-09 03:07:30,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:30,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:30,929 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-12-09 03:07:30,930 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], [154], [157], [159], [164], [167], [169], [174], [177], [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], [440], [445], [450], [455], [458], [463], [465], [470], [472], [477], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:30,931 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:30,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:31,217 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:31,217 INFO L272 AbstractInterpreter]: Visited 91 different actions 379 times. Merged at 73 different actions 259 times. Never widened. Performed 3121 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 19 different actions. Largest state had 139 variables. [2018-12-09 03:07:31,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:31,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:31,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:31,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:07:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:31,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:31,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:31,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,324 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-09 03:07:31,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,337 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-09 03:07:31,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,353 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-09 03:07:31,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,378 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-09 03:07:31,379 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-09 03:07:31,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,381 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-09 03:07:31,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,385 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-09 03:07:31,385 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,391 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,394 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,406 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-09 03:07:31,406 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 03:07:31,436 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-09 03:07:31,438 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-09 03:07:31,457 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-09 03:07:31,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,465 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-09 03:07:31,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,479 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-09 03:07:31,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,517 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 84 [2018-12-09 03:07:31,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 127 [2018-12-09 03:07:31,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,535 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,541 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 03:07:31,557 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-09 03:07:31,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,562 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-09 03:07:31,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:31,586 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-09 03:07:31,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,592 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-09 03:07:31,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:31,612 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-09 03:07:31,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,618 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-09 03:07:31,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,642 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-09 03:07:31,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,647 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-09 03:07:31,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:31,668 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-09 03:07:31,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,677 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-09 03:07:31,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:31,700 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-09 03:07:31,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,706 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-09 03:07:31,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 03:07:31,727 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-09 03:07:31,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,734 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-09 03:07:31,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,758 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-09 03:07:31,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,763 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-09 03:07:31,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:31,784 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-09 03:07:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-09 03:07:31,786 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-09 03:07:31,787 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-09 03:07:31,799 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-09 03:07:31,801 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-09 03:07:31,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:07:31,814 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-09 03:07:31,816 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-09 03:07:31,829 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-09 03:07:31,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,836 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-09 03:07:31,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,847 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-09 03:07:31,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 03:07:31,883 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-09 03:07:31,885 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-09 03:07:31,885 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-09 03:07:31,887 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-09 03:07:31,900 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-09 03:07:31,901 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-09 03:07:31,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-09 03:07:31,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 109 treesize of output 80 [2018-12-09 03:07:31,922 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-09 03:07:31,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,936 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-09 03:07:31,938 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-09 03:07:31,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,950 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-09 03:07:31,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:31,953 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-09 03:07:31,954 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:31,966 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-09 03:07:31,972 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-09 03:07:31,987 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-09 03:07:31,988 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-09 03:07:32,000 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 85 [2018-12-09 03:07:32,008 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 80 treesize of output 64 [2018-12-09 03:07:32,009 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-09 03:07:32,013 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-09 03:07:32,019 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 15 treesize of output 13 [2018-12-09 03:07:32,020 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 13 treesize of output 9 [2018-12-09 03:07:32,020 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-09 03:07:32,021 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-09 03:07:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:32,025 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:207, output treesize:32 [2018-12-09 03:07:32,049 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 37 treesize of output 33 [2018-12-09 03:07:32,050 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-09 03:07:32,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:32,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:32,056 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-09 03:07:32,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,060 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-09 03:07:32,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-09 03:07:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-09 03:07:32,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:32,275 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-09 03:07:32,277 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-09 03:07:32,281 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 73 treesize of output 65 [2018-12-09 03:07:32,282 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-09 03:07:32,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:32,288 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:32,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 0 case distinctions, treesize of input 64 treesize of output 80 [2018-12-09 03:07:32,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:32,291 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 50 treesize of output 42 [2018-12-09 03:07:32,291 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,304 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 14 [2018-12-09 03:07:32,305 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-09 03:07:32,306 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,309 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-09 03:07:32,312 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-09 03:07:32,315 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 14 treesize of output 12 [2018-12-09 03:07:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 03:07:32,316 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,317 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:32,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:32,318 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:84, output treesize:15 [2018-12-09 03:07:32,336 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-09 03:07:32,337 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-09 03:07:32,339 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-09 03:07:32,340 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-09 03:07:32,341 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-09 03:07:32,342 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-09 03:07:32,343 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-09 03:07:32,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 03:07:32,371 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-09 03:07:32,372 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-09 03:07:32,379 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-09 03:07:32,380 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-09 03:07:32,381 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-09 03:07:32,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-09 03:07:32,394 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-09 03:07:32,395 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-09 03:07:32,398 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-09 03:07:32,399 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-09 03:07:32,399 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-09 03:07:32,400 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-09 03:07:32,402 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-09 03:07:32,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-09 03:07:32,423 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-09 03:07:32,425 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-09 03:07:32,432 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-09 03:07:32,433 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-09 03:07:32,434 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-09 03:07:32,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 03:07:32,451 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-09 03:07:32,452 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-09 03:07:32,453 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-09 03:07:32,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:32,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-09 03:07:32,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-09 03:07:32,470 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-09 03:07:32,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:32,482 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-09 03:07:32,484 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-09 03:07:32,491 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-09 03:07:32,492 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-09 03:07:32,493 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-09 03:07:32,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-09 03:07:32,507 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-09 03:07:32,508 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-09 03:07:32,509 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-09 03:07:32,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:32,525 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-09 03:07:32,526 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-09 03:07:32,527 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-09 03:07:32,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-09 03:07:32,541 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-09 03:07:32,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-09 03:07:32,548 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-09 03:07:32,550 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-09 03:07:32,556 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-09 03:07:32,558 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-09 03:07:32,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 03:07:32,559 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:20 [2018-12-09 03:07:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-09 03:07:32,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 03:07:32,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 23 [2018-12-09 03:07:32,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 03:07:32,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 03:07:32,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 03:07:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-09 03:07:32,682 INFO L87 Difference]: Start difference. First operand 6872 states and 10954 transitions. Second operand 18 states. [2018-12-09 03:07:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:35,306 INFO L93 Difference]: Finished difference Result 14512 states and 23024 transitions. [2018-12-09 03:07:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 03:07:35,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 264 [2018-12-09 03:07:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:35,312 INFO L225 Difference]: With dead ends: 14512 [2018-12-09 03:07:35,312 INFO L226 Difference]: Without dead ends: 7667 [2018-12-09 03:07:35,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 513 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-12-09 03:07:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7667 states. [2018-12-09 03:07:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7667 to 6661. [2018-12-09 03:07:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-09 03:07:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10593 transitions. [2018-12-09 03:07:35,830 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10593 transitions. Word has length 264 [2018-12-09 03:07:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:35,830 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10593 transitions. [2018-12-09 03:07:35,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 03:07:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10593 transitions. [2018-12-09 03:07:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-09 03:07:35,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:35,833 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] [2018-12-09 03:07:35,833 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:35,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1120793380, now seen corresponding path program 1 times [2018-12-09 03:07:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:35,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:35,889 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-09 03:07:35,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:35,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:35,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:35,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:35,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:35,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:35,890 INFO L87 Difference]: Start difference. First operand 6661 states and 10593 transitions. Second operand 4 states. [2018-12-09 03:07:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:36,611 INFO L93 Difference]: Finished difference Result 13344 states and 21216 transitions. [2018-12-09 03:07:36,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:36,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-12-09 03:07:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:36,616 INFO L225 Difference]: With dead ends: 13344 [2018-12-09 03:07:36,616 INFO L226 Difference]: Without dead ends: 6710 [2018-12-09 03:07:36,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-09 03:07:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2018-12-09 03:07:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6661. [2018-12-09 03:07:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-09 03:07:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10590 transitions. [2018-12-09 03:07:37,127 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10590 transitions. Word has length 279 [2018-12-09 03:07:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:37,127 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10590 transitions. [2018-12-09 03:07:37,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10590 transitions. [2018-12-09 03:07:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-09 03:07:37,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:37,130 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] [2018-12-09 03:07:37,130 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:37,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1469364017, now seen corresponding path program 1 times [2018-12-09 03:07:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:37,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:37,182 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-09 03:07:37,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:37,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 03:07:37,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:37,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:37,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:37,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 03:07:37,183 INFO L87 Difference]: Start difference. First operand 6661 states and 10590 transitions. Second operand 4 states. [2018-12-09 03:07:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:37,881 INFO L93 Difference]: Finished difference Result 13332 states and 21195 transitions. [2018-12-09 03:07:37,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:37,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-12-09 03:07:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:37,887 INFO L225 Difference]: With dead ends: 13332 [2018-12-09 03:07:37,887 INFO L226 Difference]: Without dead ends: 6698 [2018-12-09 03:07:37,891 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-09 03:07:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2018-12-09 03:07:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6661. [2018-12-09 03:07:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2018-12-09 03:07:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 10587 transitions. [2018-12-09 03:07:38,421 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 10587 transitions. Word has length 280 [2018-12-09 03:07:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:38,421 INFO L480 AbstractCegarLoop]: Abstraction has 6661 states and 10587 transitions. [2018-12-09 03:07:38,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 10587 transitions. [2018-12-09 03:07:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-09 03:07:38,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:38,423 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 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] [2018-12-09 03:07:38,423 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:38,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2074707236, now seen corresponding path program 1 times [2018-12-09 03:07:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:38,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:38,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-09 03:07:38,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:38,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 03:07:38,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:38,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:07:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:07:38,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 03:07:38,508 INFO L87 Difference]: Start difference. First operand 6661 states and 10587 transitions. Second operand 6 states. [2018-12-09 03:07:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:40,500 INFO L93 Difference]: Finished difference Result 14490 states and 22782 transitions. [2018-12-09 03:07:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 03:07:40,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2018-12-09 03:07:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:40,506 INFO L225 Difference]: With dead ends: 14490 [2018-12-09 03:07:40,506 INFO L226 Difference]: Without dead ends: 7856 [2018-12-09 03:07:40,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 03:07:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7856 states. [2018-12-09 03:07:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7856 to 6609. [2018-12-09 03:07:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2018-12-09 03:07:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 10459 transitions. [2018-12-09 03:07:41,029 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 10459 transitions. Word has length 280 [2018-12-09 03:07:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:41,029 INFO L480 AbstractCegarLoop]: Abstraction has 6609 states and 10459 transitions. [2018-12-09 03:07:41,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:07:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 10459 transitions. [2018-12-09 03:07:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-09 03:07:41,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:41,031 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 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] [2018-12-09 03:07:41,031 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:41,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1410139380, now seen corresponding path program 1 times [2018-12-09 03:07:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:41,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:41,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 541 proven. 16 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-12-09 03:07:41,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:41,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:41,130 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-12-09 03:07:41,130 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:41,131 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:41,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:41,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:41,465 INFO L272 AbstractInterpreter]: Visited 98 different actions 417 times. Merged at 79 different actions 286 times. Never widened. Performed 3501 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3501 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 19 different actions. Largest state had 151 variables. [2018-12-09 03:07:41,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:41,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:41,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:41,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:07:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:41,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:41,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:41,598 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-09 03:07:41,600 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-09 03:07:41,601 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-09 03:07:41,605 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-09 03:07:41,607 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-09 03:07:41,608 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-09 03:07:41,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,613 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-09 03:07:41,615 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-09 03:07:41,615 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-09 03:07:41,621 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-09 03:07:41,655 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-09 03:07:41,657 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-09 03:07:41,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,658 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,660 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-09 03:07:41,661 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-09 03:07:41,662 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-09 03:07:41,667 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-09 03:07:41,669 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-09 03:07:41,670 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-09 03:07:41,671 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-09 03:07:41,676 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-09 03:07:41,719 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-09 03:07:41,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,722 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-09 03:07:41,722 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,750 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-09 03:07:41,750 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-12-09 03:07:41,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,806 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-09 03:07:41,806 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,810 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,845 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-09 03:07:41,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,848 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-09 03:07:41,848 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,864 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-09 03:07:41,864 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,869 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,879 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-09 03:07:41,883 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-09 03:07:41,884 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-09 03:07:41,884 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,891 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-09 03:07:41,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:41,893 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-09 03:07:41,893 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,896 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,898 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,900 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-09 03:07:41,900 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-09 03:07:41,901 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,902 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:41,908 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:07:41,931 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-09 03:07:41,932 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-09 03:07:41,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:41,933 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-09 03:07:41,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 03:07:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 03:07:41,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 03:07:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 03:07:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-09 03:07:42,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:42,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:07:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:07:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:07:42,030 INFO L87 Difference]: Start difference. First operand 6609 states and 10459 transitions. Second operand 6 states. [2018-12-09 03:07:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:43,601 INFO L93 Difference]: Finished difference Result 13530 states and 21374 transitions. [2018-12-09 03:07:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:07:43,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 281 [2018-12-09 03:07:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:43,607 INFO L225 Difference]: With dead ends: 13530 [2018-12-09 03:07:43,607 INFO L226 Difference]: Without dead ends: 6948 [2018-12-09 03:07:43,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 557 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:07:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-09 03:07:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 6729. [2018-12-09 03:07:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-09 03:07:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 10663 transitions. [2018-12-09 03:07:44,142 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 10663 transitions. Word has length 281 [2018-12-09 03:07:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:44,142 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 10663 transitions. [2018-12-09 03:07:44,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:07:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 10663 transitions. [2018-12-09 03:07:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-09 03:07:44,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:44,144 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 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] [2018-12-09 03:07:44,144 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:44,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash -60846517, now seen corresponding path program 1 times [2018-12-09 03:07:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:44,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 541 proven. 17 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2018-12-09 03:07:44,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:44,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:44,270 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 283 with the following transitions: [2018-12-09 03:07:44,270 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:44,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:44,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:44,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:44,602 INFO L272 AbstractInterpreter]: Visited 98 different actions 417 times. Merged at 79 different actions 286 times. Never widened. Performed 3501 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3501 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 19 different actions. Largest state had 151 variables. [2018-12-09 03:07:44,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:44,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:44,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:44,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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-09 03:07:44,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:44,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:44,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:44,723 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-09 03:07:44,725 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-09 03:07:44,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,729 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-09 03:07:44,731 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-09 03:07:44,731 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-09 03:07:44,735 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-09 03:07:44,737 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-09 03:07:44,738 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-09 03:07:44,738 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-09 03:07:44,744 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-09 03:07:44,783 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 83 [2018-12-09 03:07:44,786 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 66 treesize of output 65 [2018-12-09 03:07:44,786 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,817 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 66 [2018-12-09 03:07:44,818 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,862 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 64 treesize of output 95 [2018-12-09 03:07:44,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,867 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 83 treesize of output 89 [2018-12-09 03:07:44,867 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,901 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 45 treesize of output 62 [2018-12-09 03:07:44,902 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,911 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:44,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,943 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 79 [2018-12-09 03:07:44,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,945 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 62 treesize of output 49 [2018-12-09 03:07:44,945 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,963 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 45 treesize of output 62 [2018-12-09 03:07:44,964 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,972 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:44,987 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-09 03:07:44,989 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 55 treesize of output 45 [2018-12-09 03:07:44,990 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-09 03:07:44,990 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:44,996 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 35 treesize of output 41 [2018-12-09 03:07:44,997 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 32 treesize of output 15 [2018-12-09 03:07:44,998 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:44,999 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,002 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-09 03:07:45,007 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-09 03:07:45,007 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:45,015 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 49 treesize of output 56 [2018-12-09 03:07:45,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:45,017 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 37 treesize of output 24 [2018-12-09 03:07:45,017 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,019 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,021 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,031 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 18 [2018-12-09 03:07:45,032 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 8 treesize of output 4 [2018-12-09 03:07:45,032 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,033 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,035 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-09 03:07:45,036 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-09 03:07:45,036 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,037 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:45,040 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:07:45,062 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-09 03:07:45,063 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-09 03:07:45,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:45,065 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-09 03:07:45,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 03:07:45,095 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 03:07:45,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-12-09 03:07:45,174 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 03:07:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-09 03:07:45,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:45,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:07:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:07:45,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:07:45,174 INFO L87 Difference]: Start difference. First operand 6729 states and 10663 transitions. Second operand 6 states. [2018-12-09 03:07:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:46,167 INFO L93 Difference]: Finished difference Result 13642 states and 21566 transitions. [2018-12-09 03:07:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:07:46,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2018-12-09 03:07:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:46,172 INFO L225 Difference]: With dead ends: 13642 [2018-12-09 03:07:46,172 INFO L226 Difference]: Without dead ends: 6940 [2018-12-09 03:07:46,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 559 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:07:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2018-12-09 03:07:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 6733. [2018-12-09 03:07:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2018-12-09 03:07:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 10667 transitions. [2018-12-09 03:07:46,694 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 10667 transitions. Word has length 282 [2018-12-09 03:07:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:46,694 INFO L480 AbstractCegarLoop]: Abstraction has 6733 states and 10667 transitions. [2018-12-09 03:07:46,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:07:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 10667 transitions. [2018-12-09 03:07:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-09 03:07:46,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:46,697 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 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] [2018-12-09 03:07:46,697 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:46,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1540001408, now seen corresponding path program 1 times [2018-12-09 03:07:46,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:46,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:46,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:46,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:46,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-12-09 03:07:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 03:07:46,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:46,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 03:07:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 03:07:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 03:07:46,782 INFO L87 Difference]: Start difference. First operand 6733 states and 10667 transitions. Second operand 5 states. [2018-12-09 03:07:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:47,852 INFO L93 Difference]: Finished difference Result 13938 states and 21963 transitions. [2018-12-09 03:07:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:47,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 282 [2018-12-09 03:07:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:47,877 INFO L225 Difference]: With dead ends: 13938 [2018-12-09 03:07:47,877 INFO L226 Difference]: Without dead ends: 7232 [2018-12-09 03:07:47,879 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-09 03:07:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2018-12-09 03:07:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 6673. [2018-12-09 03:07:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2018-12-09 03:07:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 10547 transitions. [2018-12-09 03:07:48,401 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 10547 transitions. Word has length 282 [2018-12-09 03:07:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:48,401 INFO L480 AbstractCegarLoop]: Abstraction has 6673 states and 10547 transitions. [2018-12-09 03:07:48,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 03:07:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 10547 transitions. [2018-12-09 03:07:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 03:07:48,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:48,404 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:48,404 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:48,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -237532608, now seen corresponding path program 1 times [2018-12-09 03:07:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:48,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2018-12-09 03:07:48,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 03:07:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 03:07:48,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:48,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 03:07:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 03:07:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 03:07:48,459 INFO L87 Difference]: Start difference. First operand 6673 states and 10547 transitions. Second operand 3 states. [2018-12-09 03:07:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:49,201 INFO L93 Difference]: Finished difference Result 16228 states and 25452 transitions. [2018-12-09 03:07:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 03:07:49,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-12-09 03:07:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:49,210 INFO L225 Difference]: With dead ends: 16228 [2018-12-09 03:07:49,210 INFO L226 Difference]: Without dead ends: 9582 [2018-12-09 03:07:49,214 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-09 03:07:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9582 states. [2018-12-09 03:07:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9582 to 9578. [2018-12-09 03:07:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 03:07:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14904 transitions. [2018-12-09 03:07:50,029 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14904 transitions. Word has length 285 [2018-12-09 03:07:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:50,029 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14904 transitions. [2018-12-09 03:07:50,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 03:07:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14904 transitions. [2018-12-09 03:07:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-09 03:07:50,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:50,033 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:50,033 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -307559414, now seen corresponding path program 1 times [2018-12-09 03:07:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:50,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:50,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 593 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-09 03:07:50,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:50,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:50,158 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-12-09 03:07:50,158 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:50,159 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:50,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:50,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:50,473 INFO L272 AbstractInterpreter]: Visited 95 different actions 403 times. Merged at 77 different actions 279 times. Never widened. Performed 3341 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 17 different actions. Largest state had 148 variables. [2018-12-09 03:07:50,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:50,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:50,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:50,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 03:07:50,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:50,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:50,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:50,581 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-09 03:07:50,582 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-09 03:07:50,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 03:07:50,625 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-09 03:07:50,627 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-09 03:07:50,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,660 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-09 03:07:50,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,693 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 76 treesize of output 89 [2018-12-09 03:07:50,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,698 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 68 treesize of output 59 [2018-12-09 03:07:50,698 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,737 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-09 03:07:50,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,740 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 92 treesize of output 61 [2018-12-09 03:07:50,740 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,759 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-09 03:07:50,760 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,770 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:50,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,782 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-09 03:07:50,784 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-09 03:07:50,784 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,791 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-09 03:07:50,793 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:07:50,793 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-09 03:07:50,793 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,796 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,799 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-09 03:07:50,803 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-09 03:07:50,805 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-09 03:07:50,805 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,812 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-09 03:07:50,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:50,815 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-09 03:07:50,815 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,817 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,819 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-09 03:07:50,831 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-09 03:07:50,832 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-09 03:07:50,832 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,833 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,834 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-09 03:07:50,835 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-09 03:07:50,835 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,838 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,844 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-09 03:07:50,845 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-09 03:07:50,845 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,846 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:50,848 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:07:50,857 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-09 03:07:50,858 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-09 03:07:50,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,863 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-09 03:07:50,863 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-09 03:07:50,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,866 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-09 03:07:50,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-09 03:07:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 563 proven. 10 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-12-09 03:07:50,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:50,906 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:50,906 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-09 03:07:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-09 03:07:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 03:07:50,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 11 [2018-12-09 03:07:50,957 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:50,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 03:07:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 03:07:50,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 03:07:50,958 INFO L87 Difference]: Start difference. First operand 9578 states and 14904 transitions. Second operand 4 states. [2018-12-09 03:07:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:52,427 INFO L93 Difference]: Finished difference Result 19850 states and 30724 transitions. [2018-12-09 03:07:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 03:07:52,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2018-12-09 03:07:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:52,435 INFO L225 Difference]: With dead ends: 19850 [2018-12-09 03:07:52,435 INFO L226 Difference]: Without dead ends: 10326 [2018-12-09 03:07:52,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-09 03:07:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2018-12-09 03:07:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 9578. [2018-12-09 03:07:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 03:07:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14773 transitions. [2018-12-09 03:07:53,236 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14773 transitions. Word has length 285 [2018-12-09 03:07:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:53,236 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14773 transitions. [2018-12-09 03:07:53,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 03:07:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14773 transitions. [2018-12-09 03:07:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-09 03:07:53,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:53,240 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 03:07:53,240 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:53,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1429227305, now seen corresponding path program 1 times [2018-12-09 03:07:53,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:53,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:53,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:53,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 554 proven. 15 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-12-09 03:07:53,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:53,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:53,366 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 287 with the following transitions: [2018-12-09 03:07:53,366 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [62], [64], [69], [74], [77], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [137], [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], [564], [598], [600], [612], [615], [616], [617], [619] [2018-12-09 03:07:53,368 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 03:07:53,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 03:07:53,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 03:07:53,606 INFO L272 AbstractInterpreter]: Visited 96 different actions 332 times. Merged at 76 different actions 211 times. Never widened. Performed 2627 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 17 different actions. Largest state had 148 variables. [2018-12-09 03:07:53,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:53,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 03:07:53,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:53,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 03:07:53,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:53,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 03:07:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:07:53,725 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-09 03:07:53,726 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-09 03:07:53,727 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-09 03:07:53,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-09 03:07:53,732 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-09 03:07:53,733 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-09 03:07:53,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,738 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-09 03:07:53,740 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-09 03:07:53,740 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-09 03:07:53,744 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-09 03:07:53,770 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-09 03:07:53,772 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-09 03:07:53,772 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-09 03:07:53,776 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-09 03:07:53,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 55 treesize of output 49 [2018-12-09 03:07:53,778 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-09 03:07:53,778 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,779 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,781 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-09 03:07:53,782 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-09 03:07:53,782 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-09 03:07:53,786 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-09 03:07:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 03:07:53,809 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-09 03:07:53,809 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,811 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,816 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-09 03:07:53,818 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-09 03:07:53,818 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,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, 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-09 03:07:53,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,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 31 treesize of output 18 [2018-12-09 03:07:53,828 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,831 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,835 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-09 03:07:53,850 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-09 03:07:53,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,855 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-09 03:07:53,855 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,883 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-09 03:07:53,884 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,923 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-09 03:07:53,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,929 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 71 treesize of output 71 [2018-12-09 03:07:53,929 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,953 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-09 03:07:53,953 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:53,963 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:53,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07: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, 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-09 03:07:53,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:53,996 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 47 treesize of output 44 [2018-12-09 03:07:53,997 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:07:54,016 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 33 [2018-12-09 03:07:54,016 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,023 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,032 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:07:54,039 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-09 03:07:54,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 19 treesize of output 15 [2018-12-09 03:07:54,064 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-09 03:07:54,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:07:54,065 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-09 03:07:54,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-09 03:07:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-09 03:07:54,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:07:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-12-09 03:07:54,159 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 03:07:54,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-09 03:07:54,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 03:07:54,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 03:07:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 03:07:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 03:07:54,161 INFO L87 Difference]: Start difference. First operand 9578 states and 14773 transitions. Second operand 6 states. [2018-12-09 03:07:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:07:55,393 INFO L93 Difference]: Finished difference Result 18929 states and 29091 transitions. [2018-12-09 03:07:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 03:07:55,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 286 [2018-12-09 03:07:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:07:55,401 INFO L225 Difference]: With dead ends: 18929 [2018-12-09 03:07:55,401 INFO L226 Difference]: Without dead ends: 9895 [2018-12-09 03:07:55,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 567 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-09 03:07:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2018-12-09 03:07:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 9578. [2018-12-09 03:07:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 03:07:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 14765 transitions. [2018-12-09 03:07:56,198 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 14765 transitions. Word has length 286 [2018-12-09 03:07:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:07:56,198 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 14765 transitions. [2018-12-09 03:07:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 03:07:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 14765 transitions. [2018-12-09 03:07:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-09 03:07:56,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:07:56,202 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] [2018-12-09 03:07:56,202 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:07:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:07:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1534309706, now seen corresponding path program 2 times [2018-12-09 03:07:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:07:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 03:07:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:07:56,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:07:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 03:07:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 421 proven. 445 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-09 03:07:57,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:57,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 03:07:57,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 03:07:57,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 03:07:57,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 03:07:57,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 03:07:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 03:07:57,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 03:08:04,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 03:08:04,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 03:08:04,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 03:08:04,776 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-09 03:08:04,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 16 treesize of output 1 [2018-12-09 03:08:04,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:04,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:04,828 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-09 03:08:04,831 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-09 03:08:04,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:04,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-09 03:08:04,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:04,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, 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-09 03:08:04,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:04,963 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-09 03:08:04,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,071 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-09 03:08:05,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,080 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,104 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 50 treesize of output 113 [2018-12-09 03:08:05,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,175 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-09 03:08:05,175 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:08:05,330 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-09 03:08:05,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,335 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-09 03:08:05,335 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,348 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,438 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-09 03:08:05,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,454 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-09 03:08:05,454 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,505 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 39 treesize of output 58 [2018-12-09 03:08:05,505 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,533 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,572 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-09 03:08:05,606 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-09 03:08:05,670 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 138 treesize of output 137 [2018-12-09 03:08:05,673 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 139 treesize of output 99 [2018-12-09 03:08:05,673 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,718 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 120 treesize of output 88 [2018-12-09 03:08:05,719 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,748 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:05,754 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 139 treesize of output 114 [2018-12-09 03:08:05,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,758 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 83 treesize of output 106 [2018-12-09 03:08:05,758 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,770 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,775 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 157 treesize of output 128 [2018-12-09 03:08:05,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 142 [2018-12-09 03:08:05,781 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,796 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,866 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 127 treesize of output 112 [2018-12-09 03:08:05,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,871 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 103 [2018-12-09 03:08:05,872 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,880 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,883 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 109 treesize of output 98 [2018-12-09 03:08:05,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-12-09 03:08:05,888 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,895 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,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 97 treesize of output 94 [2018-12-09 03:08:05,900 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-09 03:08:05,900 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,907 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,910 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 97 [2018-12-09 03:08:05,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,914 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 79 treesize of output 79 [2018-12-09 03:08:05,914 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,921 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,971 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 67 [2018-12-09 03:08:05,973 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:05,974 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 0 case distinctions, treesize of input 49 treesize of output 9 [2018-12-09 03:08:05,974 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,978 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,981 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 108 treesize of output 91 [2018-12-09 03:08:05,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:05,985 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 67 treesize of output 121 [2018-12-09 03:08:05,985 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:05,991 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,004 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 89 treesize of output 103 [2018-12-09 03:08:06,007 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 90 treesize of output 50 [2018-12-09 03:08:06,007 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,036 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 83 treesize of output 94 [2018-12-09 03:08:06,036 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:06,051 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:06,055 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 90 treesize of output 75 [2018-12-09 03:08:06,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,059 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 48 treesize of output 94 [2018-12-09 03:08:06,059 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,066 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,096 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 54 [2018-12-09 03:08:06,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,099 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-09 03:08:06,099 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,104 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,107 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 61 [2018-12-09 03:08:06,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,109 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 34 treesize of output 49 [2018-12-09 03:08:06,109 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,115 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,118 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 90 treesize of output 77 [2018-12-09 03:08:06,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-12-09 03:08:06,120 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,126 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,128 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 47 treesize of output 44 [2018-12-09 03:08:06,129 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-09 03:08:06,129 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,133 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 03:08:06,162 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 6 variables, input treesize:268, output treesize:199 [2018-12-09 03:08:06,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:06,221 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 137 [2018-12-09 03:08:06,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,226 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:06,226 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:06,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 158 [2018-12-09 03:08:06,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,523 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 117 treesize of output 110 [2018-12-09 03:08:06,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,529 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 84 [2018-12-09 03:08:06,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,848 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 106 treesize of output 95 [2018-12-09 03:08:06,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:06,851 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 60 treesize of output 60 [2018-12-09 03:08:06,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:06,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,080 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 93 [2018-12-09 03:08:07,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,083 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-09 03:08:07,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,273 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-09 03:08:07,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,277 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-09 03:08:07,277 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,288 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,454 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-09 03:08:07,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,463 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-09 03:08:07,464 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,537 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-09 03:08:07,538 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 03:08:07,606 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:08:07,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,794 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 85 treesize of output 100 [2018-12-09 03:08:07,796 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:07,796 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 71 treesize of output 134 [2018-12-09 03:08:07,796 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,807 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,953 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 90 [2018-12-09 03:08:07,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,956 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-09 03:08:07,956 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,965 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,968 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 110 [2018-12-09 03:08:07,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,971 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-09 03:08:07,971 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,981 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,983 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 99 [2018-12-09 03:08:07,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:07,987 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-09 03:08:07,987 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:07,998 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,107 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 73 [2018-12-09 03:08:08,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,110 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-09 03:08:08,110 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,117 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,119 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 78 [2018-12-09 03:08:08,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,122 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-09 03:08:08,122 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,129 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,131 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 99 [2018-12-09 03:08:08,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,137 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 51 treesize of output 45 [2018-12-09 03:08:08,137 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,147 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,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, 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-09 03:08:08,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,242 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 122 treesize of output 158 [2018-12-09 03:08:08,243 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,279 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 79 treesize of output 161 [2018-12-09 03:08:08,279 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,307 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:08,396 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 81 [2018-12-09 03:08:08,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,400 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 69 treesize of output 67 [2018-12-09 03:08:08,400 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,408 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,410 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 86 [2018-12-09 03:08:08,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,413 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-09 03:08:08,413 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,421 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,498 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 87 treesize of output 80 [2018-12-09 03:08:08,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,500 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 53 treesize of output 76 [2018-12-09 03:08:08,501 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,508 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-09 03:08:08,564 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 12 variables, input treesize:471, output treesize:428 [2018-12-09 03:08:08,688 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-09 03:08:08,690 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-09 03:08:08,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,704 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-09 03:08:08,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,719 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-09 03:08:08,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:08,776 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-09 03:08:08,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,781 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 39 treesize of output 38 [2018-12-09 03:08:08,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,787 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 13 treesize of output 1 [2018-12-09 03:08:08,788 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,790 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,831 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-09 03:08:08,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,852 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-09 03:08:08,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-12-09 03:08:08,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,909 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 49 treesize of output 67 [2018-12-09 03:08:08,909 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:08,940 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 03:08:08,976 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-09 03:08:08,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:08,989 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-09 03:08:08,990 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-09 03:08:09,014 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 03:08:09,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 03:08:09,061 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:411, output treesize:148 [2018-12-09 03:08:09,140 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-09 03:08:09,141 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-09 03:08:09,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,166 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-09 03:08:09,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:09,171 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-09 03:08:09,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,196 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-09 03:08:09,197 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-09 03:08:09,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,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, 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-09 03:08:09,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:09,216 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-09 03:08:09,216 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:09,228 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-09 03:08:09,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 281 [2018-12-09 03:08:09,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:09,359 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 268 treesize of output 284 [2018-12-09 03:08:09,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:08:09,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:08:09,848 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 279 treesize of output 239 [2018-12-09 03:08:09,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:09,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:10,845 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-09 03:08:10,934 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-09 03:08:11,621 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-09 03:08:11,677 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-09 03:08:12,327 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 232 treesize of output 198 [2018-12-09 03:08:12,331 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-09 03:08:12,331 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:12,419 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-09 03:08:12,422 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-09 03:08:12,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:12,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:12,429 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-09 03:08:12,429 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:12,447 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:12,505 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:12,545 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-09 03:08:13,050 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-09 03:08:13,078 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-09 03:08:13,415 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-09 03:08:13,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,421 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-09 03:08:13,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,431 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-09 03:08:13,432 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,442 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,464 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,743 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-09 03:08:13,747 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-09 03:08:13,747 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,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, 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-09 03:08:13,821 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-09 03:08:13,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:13,827 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-09 03:08:13,828 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,839 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,852 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:13,901 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,091 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-09 03:08:14,094 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-09 03:08:14,095 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,254 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-09 03:08:14,254 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,385 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 136 treesize of output 107 [2018-12-09 03:08:14,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,391 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 68 treesize of output 105 [2018-12-09 03:08:14,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,403 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 94 treesize of output 196 [2018-12-09 03:08:14,403 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,414 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,425 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,541 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-09 03:08:14,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,548 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-09 03:08:14,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,568 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-09 03:08:14,568 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,590 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,643 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-09 03:08:14,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:14,650 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-09 03:08:14,650 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,666 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,687 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,732 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:14,823 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-09 03:08:14,862 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-09 03:08:14,935 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-09 03:08:14,971 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-09 03:08:15,065 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 220 treesize of output 221 [2018-12-09 03:08:15,068 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-09 03:08:15,068 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,096 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,173 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 171 treesize of output 140 [2018-12-09 03:08:15,175 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-09 03:08:15,175 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,199 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 77 treesize of output 71 [2018-12-09 03:08:15,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,203 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-09 03:08:15,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,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, 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-09 03:08:15,210 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,219 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,226 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,240 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,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 121 treesize of output 114 [2018-12-09 03:08:15,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,286 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-09 03:08:15,287 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,299 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,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 102 treesize of output 95 [2018-12-09 03:08:15,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,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, 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-09 03:08:15,337 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,347 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:15,373 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 14 variables, input treesize:551, output treesize:133 [2018-12-09 03:08:15,522 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-09 03:08:15,523 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-09 03:08:15,524 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-09 03:08:15,532 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-09 03:08:15,556 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-09 03:08:15,557 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-09 03:08:15,558 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-09 03:08:15,566 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-09 03:08:15,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,600 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 74 treesize of output 98 [2018-12-09 03:08:15,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,605 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 91 treesize of output 121 [2018-12-09 03:08:15,605 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,638 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 66 treesize of output 148 [2018-12-09 03:08:15,638 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 03:08:15,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,699 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 66 treesize of output 79 [2018-12-09 03:08:15,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,702 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-09 03:08:15,703 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,738 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 78 treesize of output 70 [2018-12-09 03:08:15,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 55 treesize of output 39 [2018-12-09 03:08:15,740 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-09 03:08:15,748 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-09 03:08:15,750 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 65 treesize of output 59 [2018-12-09 03:08:15,751 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 43 treesize of output 31 [2018-12-09 03:08:15,752 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:08:15,758 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 03:08:15,781 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 53 treesize of output 49 [2018-12-09 03:08:15,783 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 33 treesize of output 25 [2018-12-09 03:08:15,783 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-09 03:08:15,788 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-09 03:08:15,810 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-09 03:08:15,811 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:171, output treesize:140 [2018-12-09 03:08:15,886 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 48 [2018-12-09 03:08:15,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,889 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 33 treesize of output 32 [2018-12-09 03:08:15,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,911 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 50 treesize of output 40 [2018-12-09 03:08:15,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:15,913 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 26 treesize of output 24 [2018-12-09 03:08:15,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,919 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-09 03:08:15,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:15,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:109, output treesize:7 [2018-12-09 03:08:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 683 proven. 68 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-09 03:08:16,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 03:08:16,376 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-09 03:08:16,384 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-09 03:08:16,428 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-09 03:08:16,436 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-09 03:08:16,469 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-09 03:08:16,474 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-09 03:08:16,500 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-09 03:08:16,505 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-09 03:08:16,530 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-09 03:08:16,533 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-09 03:08:16,546 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 126 treesize of output 94 [2018-12-09 03:08:16,561 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-09 03:08:16,561 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,581 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,583 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 87 treesize of output 86 [2018-12-09 03:08:16,585 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-09 03:08:16,585 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,593 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-09 03:08:16,594 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,596 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:16,599 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 92 treesize of output 92 [2018-12-09 03:08:16,602 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,602 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,602 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-09 03:08:16,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,623 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,624 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,625 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:16,625 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-09 03:08:16,625 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,633 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,643 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,655 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-09 03:08:16,672 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,678 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:16,678 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-09 03:08:16,680 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-09 03:08:16,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 03:08:16,690 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:322, output treesize:197 [2018-12-09 03:08:16,746 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-09 03:08:16,748 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-09 03:08:16,754 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-09 03:08:16,756 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-09 03:08:16,760 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 93 treesize of output 91 [2018-12-09 03:08:16,763 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 86 treesize of output 82 [2018-12-09 03:08:16,763 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-09 03:08:16,765 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-09 03:08:16,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 03:08:16,767 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:82 [2018-12-09 03:08:17,151 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 10 treesize of output 8 [2018-12-09 03:08:17,152 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-09 03:08:17,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:10, output treesize:1 [2018-12-09 03:08:17,257 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-09 03:08:17,262 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-09 03:08:17,299 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-09 03:08:17,304 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-09 03:08:17,332 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-09 03:08:17,338 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-09 03:08:17,358 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-09 03:08:17,363 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-09 03:08:17,378 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-09 03:08:17,382 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-09 03:08:17,398 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-09 03:08:17,402 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-09 03:08:17,408 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 164 treesize of output 132 [2018-12-09 03:08:17,428 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-09 03:08:17,428 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,444 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,446 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 163 treesize of output 162 [2018-12-09 03:08:17,448 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-09 03:08:17,448 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,455 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-09 03:08:17,455 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,456 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 03:08:17,459 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 130 treesize of output 130 [2018-12-09 03:08:17,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,462 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-09 03:08:17,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 03:08:17,483 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-09 03:08:17,483 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,489 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,498 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,508 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-09 03:08:17,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 03:08:17,518 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:322, output treesize:197 [2018-12-09 03:08:17,573 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-09 03:08:17,576 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-09 03:08:17,582 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-09 03:08:17,585 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-09 03:08:17,587 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-09 03:08:17,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:93 [2018-12-09 03:08:17,705 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-09 03:08:17,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-09 03:08:17,715 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-09 03:08:17,718 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-09 03:08:17,723 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-09 03:08:17,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:116, output treesize:116 [2018-12-09 03:08:17,807 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-09 03:08:17,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 03:08:17,812 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-09 03:08:17,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:382, output treesize:1 [2018-12-09 03:08:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 520 proven. 279 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-09 03:08:17,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 03:08:18,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 44 [2018-12-09 03:08:18,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 03:08:18,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 03:08:18,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 03:08:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1681, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 03:08:18,000 INFO L87 Difference]: Start difference. First operand 9578 states and 14765 transitions. Second operand 30 states. [2018-12-09 03:08:21,335 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2018-12-09 03:08:26,866 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2018-12-09 03:08:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 03:08:41,156 INFO L93 Difference]: Finished difference Result 31801 states and 47543 transitions. [2018-12-09 03:08:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-09 03:08:41,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 293 [2018-12-09 03:08:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 03:08:41,173 INFO L225 Difference]: With dead ends: 31801 [2018-12-09 03:08:41,173 INFO L226 Difference]: Without dead ends: 22277 [2018-12-09 03:08:41,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 554 SyntacticMatches, 20 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2337, Invalid=11003, Unknown=0, NotChecked=0, Total=13340 [2018-12-09 03:08:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22277 states. [2018-12-09 03:08:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22277 to 11537. [2018-12-09 03:08:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2018-12-09 03:08:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 17905 transitions. [2018-12-09 03:08:42,217 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 17905 transitions. Word has length 293 [2018-12-09 03:08:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 03:08:42,217 INFO L480 AbstractCegarLoop]: Abstraction has 11537 states and 17905 transitions. [2018-12-09 03:08:42,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 03:08:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 17905 transitions. [2018-12-09 03:08:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-09 03:08:42,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 03:08:42,221 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] [2018-12-09 03:08:42,221 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 03:08:42,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 03:08:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1662029545, now seen corresponding path program 1 times [2018-12-09 03:08:42,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 03:08:42,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:42,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 03:08:42,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 03:08:42,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 03:08:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 03:08:42,395 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 03:08:42,437 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24593 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-09 03:08:42,438 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24623 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-09 03:08:42,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:08:42 BoogieIcfgContainer [2018-12-09 03:08:42,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 03:08:42,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 03:08:42,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 03:08:42,492 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 03:08:42,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:05:38" (3/4) ... [2018-12-09 03:08:42,495 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 03:08:42,495 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 03:08:42,495 INFO L168 Benchmark]: Toolchain (without parser) took 185426.98 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 794.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: CDTParser took 0.12 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-09 03:08:42,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: Boogie Preprocessor took 58.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: RCFGBuilder took 545.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: TraceAbstraction took 184395.94 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 720.2 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:42,496 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 03:08:42,497 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 545.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 94.1 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 184395.94 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 874.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.3 MB). Peak memory consumption was 720.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 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 24593 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 24623 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: 1711]: 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)=24636, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24591: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))={24597:0}, malloc(sizeof(SSL_CTX))={24637:0}, malloc(sizeof(SSL_SESSION))={24581:0}, malloc(sizeof(struct ssl3_state_st))={24631:0}, s={24597:0}, SSLv3_server_data={24591:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24591: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={24597:0}, s={24597:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->hit=0, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8512, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24595, (s->s3)->tmp.new_cipher={24631:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=1, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8512, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8528, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->options=24625, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8528, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->state=8544, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->verify_mode=24577, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, (s->session)->peer={0:0}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->session={24581:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24595, (s->s3)->tmp.new_cipher={24631:0}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=10, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8544, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, ret=1, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8576, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8576, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8592, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8592, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=1, s={24597:0}, s={24597:0}, s->state=8608, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] EXPR s->s3 [L1670] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24599, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->s3={24631:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1670] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1699] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8608, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=5, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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 [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1711] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, l=24595, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, 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, 156 locations, 1 error locations. UNSAFE Result, 184.3s OverallTime, 153 OverallIterations, 12 TraceHistogramMax, 95.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33039 SDtfs, 22606 SDslu, 67645 SDs, 0 SdLazy, 55838 SolverSat, 4928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7260 GetRequests, 6175 SyntacticMatches, 297 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11537occurred in iteration=152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.2s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.5s AutomataMinimizationTime, 152 MinimizatonAttempts, 41851 StatesRemovedByMinimization, 149 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 10.7s SatisfiabilityAnalysisTime, 54.3s InterpolantComputationTime, 26754 NumberOfCodeBlocks, 26576 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 29301 ConstructedInterpolants, 497 QuantifiedInterpolants, 39835512 SizeOfPredicates, 120 NumberOfNonLiveVariables, 11778 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 176 InterpolantComputations, 150 PerfectInterpolantSequences, 49734/52898 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-09 03:08:44,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 03:08:44,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 03:08:44,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 03:08:44,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 03:08:44,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 03:08:44,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 03:08:44,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 03:08:44,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 03:08:44,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 03:08:44,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 03:08:44,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 03:08:44,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 03:08:44,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 03:08:44,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 03:08:44,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 03:08:44,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 03:08:44,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 03:08:44,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 03:08:44,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 03:08:44,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 03:08:44,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 03:08:44,970 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 03:08:44,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 03:08:44,970 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 03:08:44,970 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 03:08:44,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 03:08:44,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 03:08:44,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 03:08:44,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 03:08:44,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 03:08:44,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 03:08:44,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 03:08:44,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 03:08:44,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 03:08:44,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 03:08:44,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 03:08:44,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 03:08:44,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 03:08:44,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 03:08:44,986 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 03:08:44,986 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 03:08:44,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 03:08:44,986 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 03:08:44,986 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 03:08:44,986 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 03:08:44,987 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 03:08:44,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 03:08:44,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 03:08:44,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 03:08:44,988 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 03:08:44,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 03:08:44,989 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 03:08:44,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 03:08:44,989 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 03:08:44,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 03:08:44,989 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 03:08:44,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 03:08:44,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 03:08:44,990 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 03:08:44,990 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 03:08:44,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 03:08:44,990 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 03:08:44,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 03:08:44,991 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 03:08:44,991 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 03:08:44,991 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_7b1b3368-b98a-4598-9a14-1ee333e49b3e/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 -> 6457dc37db4a96aff5ca373c1a8d071fc7ddce3b [2018-12-09 03:08:45,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 03:08:45,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 03:08:45,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 03:08:45,025 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 03:08:45,025 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 03:08:45,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-09 03:08:45,061 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/e70a93a06/b81d3c607d6e472d8f96adf10d520151/FLAGb35b5e6ee [2018-12-09 03:08:45,523 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 03:08:45,523 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/sv-benchmarks/c/ssh/s3_srvr.blast.10_false-unreach-call.i.cil.c [2018-12-09 03:08:45,531 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/e70a93a06/b81d3c607d6e472d8f96adf10d520151/FLAGb35b5e6ee [2018-12-09 03:08:46,045 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b1b3368-b98a-4598-9a14-1ee333e49b3e/bin-2019/utaipan/data/e70a93a06/b81d3c607d6e472d8f96adf10d520151 [2018-12-09 03:08:46,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 03:08:46,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 03:08:46,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 03:08:46,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 03:08:46,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 03:08:46,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:08:46" (1/1) ... [2018-12-09 03:08:46,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4559ae87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:08:46, skipping insertion in model container [2018-12-09 03:08:46,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:08:46" (1/1) ... [2018-12-09 03:08:46,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 03:08:46,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 03:08:46,297 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:08:46,309 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 03:08:46,419 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 03:08:46,420 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-09 03:08:46,422 INFO L168 Benchmark]: Toolchain (without parser) took 374.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:46,423 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-09 03:08:46,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 03:08:46,424 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 373.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.8 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...