./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff749335004059c19d9e9c2881f1952bea1250f3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff749335004059c19d9e9c2881f1952bea1250f3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:39:40,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:39:40,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:39:40,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:39:40,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:39:40,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:39:40,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:39:40,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:39:40,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:39:40,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:39:40,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:39:40,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:39:40,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:39:40,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:39:40,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:39:40,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:39:40,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:39:40,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:39:40,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:39:40,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:39:40,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:39:40,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:39:40,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:39:40,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:39:40,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:39:40,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:39:40,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:39:40,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:39:40,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:39:40,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:39:40,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:39:40,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:39:40,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:39:40,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:39:40,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:39:40,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:39:40,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:39:40,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:39:40,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:39:40,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:39:40,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:39:40,686 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:39:40,699 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:39:40,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:39:40,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:39:40,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:39:40,701 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:39:40,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:39:40,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:39:40,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:39:40,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:39:40,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:39:40,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:39:40,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:39:40,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:39:40,704 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:39:40,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:39:40,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:39:40,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:39:40,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:39:40,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:39:40,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:39:40,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:39:40,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:39:40,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:39:40,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:39:40,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:39:40,707 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:39:40,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:39:40,707 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:39:40,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff749335004059c19d9e9c2881f1952bea1250f3 [2019-11-15 23:39:40,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:39:40,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:39:40,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:39:40,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:39:40,749 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:39:40,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:39:40,800 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/546bf6caa/0edc52efe18c4f619d3b35a0f9396017/FLAG46252286b [2019-11-15 23:39:41,386 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:39:41,387 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:39:41,412 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/546bf6caa/0edc52efe18c4f619d3b35a0f9396017/FLAG46252286b [2019-11-15 23:39:41,819 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/546bf6caa/0edc52efe18c4f619d3b35a0f9396017 [2019-11-15 23:39:41,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:39:41,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:39:41,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:41,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:39:41,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:39:41,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:41" (1/1) ... [2019-11-15 23:39:41,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639c601d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:41, skipping insertion in model container [2019-11-15 23:39:41,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:39:41" (1/1) ... [2019-11-15 23:39:41,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:39:41,913 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:39:42,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:42,460 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:39:42,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:39:42,590 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:39:42,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42 WrapperNode [2019-11-15 23:39:42,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:39:42,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:42,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:39:42,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:39:42,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:39:42,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:39:42,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:39:42,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:39:42,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... [2019-11-15 23:39:42,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:39:42,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:39:42,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:39:42,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:39:42,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/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 [2019-11-15 23:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:39:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:39:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:39:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:39:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:39:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:39:42,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:39:43,076 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:39:44,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:39:44,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:39:44,046 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:39:44,046 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:39:44,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:44 BoogieIcfgContainer [2019-11-15 23:39:44,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:39:44,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:39:44,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:39:44,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:39:44,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:39:41" (1/3) ... [2019-11-15 23:39:44,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28001b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:39:44, skipping insertion in model container [2019-11-15 23:39:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:39:42" (2/3) ... [2019-11-15 23:39:44,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28001b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:39:44, skipping insertion in model container [2019-11-15 23:39:44,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:39:44" (3/3) ... [2019-11-15 23:39:44,053 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:39:44,062 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:39:44,069 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:39:44,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:39:44,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:39:44,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:39:44,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:39:44,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:39:44,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:39:44,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:39:44,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:39:44,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:39:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:39:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:39:44,127 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:44,128 INFO L380 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] [2019-11-15 23:39:44,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:44,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 23:39:44,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:44,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690961938] [2019-11-15 23:39:44,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:44,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:44,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:44,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690961938] [2019-11-15 23:39:44,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:44,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:44,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051487332] [2019-11-15 23:39:44,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:44,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:44,484 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 23:39:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:44,983 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 23:39:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:44,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:39:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:45,007 INFO L225 Difference]: With dead ends: 323 [2019-11-15 23:39:45,008 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 23:39:45,012 INFO L600 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 [2019-11-15 23:39:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 23:39:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 23:39:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 23:39:45,083 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 23:39:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 23:39:45,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 23:39:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:39:45,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:45,089 INFO L380 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] [2019-11-15 23:39:45,089 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-15 23:39:45,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:45,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765749937] [2019-11-15 23:39:45,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:45,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:45,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:45,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765749937] [2019-11-15 23:39:45,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:45,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:45,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699730911] [2019-11-15 23:39:45,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:45,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:45,251 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 23:39:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:45,632 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 23:39:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:45,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 23:39:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:45,635 INFO L225 Difference]: With dead ends: 290 [2019-11-15 23:39:45,635 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 23:39:45,637 INFO L600 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 [2019-11-15 23:39:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 23:39:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 23:39:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 23:39:45,655 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 23:39:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:45,655 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 23:39:45,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 23:39:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:39:45,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:45,665 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:45,665 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:45,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:45,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-15 23:39:45,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:45,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961789154] [2019-11-15 23:39:45,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:45,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:45,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:45,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961789154] [2019-11-15 23:39:45,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:45,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:45,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123071838] [2019-11-15 23:39:45,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:45,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:45,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:45,821 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 23:39:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:46,158 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 23:39:46,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:46,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:39:46,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:46,161 INFO L225 Difference]: With dead ends: 289 [2019-11-15 23:39:46,161 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 23:39:46,162 INFO L600 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 [2019-11-15 23:39:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 23:39:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 23:39:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 23:39:46,171 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 23:39:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:46,171 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 23:39:46,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 23:39:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:39:46,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:46,176 INFO L380 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] [2019-11-15 23:39:46,176 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-15 23:39:46,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:46,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114844136] [2019-11-15 23:39:46,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:46,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:46,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:46,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114844136] [2019-11-15 23:39:46,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:46,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:46,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9159009] [2019-11-15 23:39:46,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:46,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:46,272 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 23:39:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:46,585 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 23:39:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:46,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:39:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:46,587 INFO L225 Difference]: With dead ends: 287 [2019-11-15 23:39:46,587 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 23:39:46,589 INFO L600 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 [2019-11-15 23:39:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 23:39:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 23:39:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 23:39:46,608 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 23:39:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 23:39:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 23:39:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:39:46,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:46,612 INFO L380 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] [2019-11-15 23:39:46,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:46,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-15 23:39:46,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:46,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027357495] [2019-11-15 23:39:46,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:46,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:46,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:46,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027357495] [2019-11-15 23:39:46,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:46,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:46,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371326530] [2019-11-15 23:39:46,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:46,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:46,686 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 23:39:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:46,996 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 23:39:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:46,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:39:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:46,998 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:39:46,998 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:39:46,998 INFO L600 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 [2019-11-15 23:39:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:39:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:39:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 23:39:47,011 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 23:39:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:47,012 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 23:39:47,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 23:39:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:39:47,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:47,013 INFO L380 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] [2019-11-15 23:39:47,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-15 23:39:47,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:47,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476840853] [2019-11-15 23:39:47,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:47,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476840853] [2019-11-15 23:39:47,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:47,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:47,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504590813] [2019-11-15 23:39:47,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:47,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:47,068 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 23:39:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:47,382 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 23:39:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:47,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:39:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:47,386 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:39:47,387 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:39:47,387 INFO L600 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 [2019-11-15 23:39:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:39:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:39:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 23:39:47,393 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 23:39:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:47,393 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 23:39:47,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 23:39:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:39:47,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:47,395 INFO L380 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] [2019-11-15 23:39:47,395 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-15 23:39:47,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:47,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173288732] [2019-11-15 23:39:47,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:47,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173288732] [2019-11-15 23:39:47,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:47,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:47,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862359400] [2019-11-15 23:39:47,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:47,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:47,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:47,471 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 23:39:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:47,781 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 23:39:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:47,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 23:39:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:47,784 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:39:47,784 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:39:47,785 INFO L600 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 [2019-11-15 23:39:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:39:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:39:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 23:39:47,791 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 23:39:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:47,791 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 23:39:47,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 23:39:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:39:47,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:47,792 INFO L380 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] [2019-11-15 23:39:47,792 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-15 23:39:47,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:47,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951691824] [2019-11-15 23:39:47,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:47,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:47,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951691824] [2019-11-15 23:39:47,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:47,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:47,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70062558] [2019-11-15 23:39:47,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:47,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:47,844 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 23:39:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:48,205 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 23:39:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:48,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 23:39:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:48,207 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:39:48,207 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:39:48,207 INFO L600 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 [2019-11-15 23:39:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:39:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:39:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 23:39:48,212 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 23:39:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:48,212 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 23:39:48,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 23:39:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:39:48,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:48,214 INFO L380 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] [2019-11-15 23:39:48,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-15 23:39:48,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:48,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437994534] [2019-11-15 23:39:48,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:48,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437994534] [2019-11-15 23:39:48,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:48,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:48,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581041143] [2019-11-15 23:39:48,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:48,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:48,285 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 23:39:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:48,494 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 23:39:48,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:48,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:39:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:48,495 INFO L225 Difference]: With dead ends: 276 [2019-11-15 23:39:48,495 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 23:39:48,496 INFO L600 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 [2019-11-15 23:39:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 23:39:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 23:39:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:39:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 23:39:48,500 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 23:39:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:48,501 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 23:39:48,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 23:39:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:39:48,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:48,502 INFO L380 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] [2019-11-15 23:39:48,502 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-15 23:39:48,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:48,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142927193] [2019-11-15 23:39:48,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:48,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142927193] [2019-11-15 23:39:48,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:48,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:48,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915686532] [2019-11-15 23:39:48,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:48,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:48,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:48,560 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 23:39:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:48,856 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 23:39:48,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:48,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:39:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:48,859 INFO L225 Difference]: With dead ends: 316 [2019-11-15 23:39:48,859 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 23:39:48,859 INFO L600 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 [2019-11-15 23:39:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 23:39:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 23:39:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 23:39:48,865 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 23:39:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:48,869 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 23:39:48,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 23:39:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:39:48,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:48,870 INFO L380 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] [2019-11-15 23:39:48,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-15 23:39:48,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:48,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723258076] [2019-11-15 23:39:48,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:48,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:48,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:48,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723258076] [2019-11-15 23:39:48,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:48,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:48,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180204766] [2019-11-15 23:39:48,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:48,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:48,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:48,949 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 23:39:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:49,325 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 23:39:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:49,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:39:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:49,327 INFO L225 Difference]: With dead ends: 338 [2019-11-15 23:39:49,327 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 23:39:49,328 INFO L600 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 [2019-11-15 23:39:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 23:39:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 23:39:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 23:39:49,334 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 23:39:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:49,334 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 23:39:49,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 23:39:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:39:49,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:49,336 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 23:39:49,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-15 23:39:49,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:49,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769884005] [2019-11-15 23:39:49,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:49,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:49,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:49,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769884005] [2019-11-15 23:39:49,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:49,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:49,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240997934] [2019-11-15 23:39:49,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:49,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:49,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:49,388 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 23:39:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:49,728 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 23:39:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:49,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:39:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:49,730 INFO L225 Difference]: With dead ends: 337 [2019-11-15 23:39:49,730 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 23:39:49,730 INFO L600 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 [2019-11-15 23:39:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 23:39:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 23:39:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 23:39:49,735 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 23:39:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:49,736 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 23:39:49,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 23:39:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:39:49,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:49,738 INFO L380 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] [2019-11-15 23:39:49,738 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-15 23:39:49,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:49,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792953889] [2019-11-15 23:39:49,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:49,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:49,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:49,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792953889] [2019-11-15 23:39:49,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:49,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:49,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172269516] [2019-11-15 23:39:49,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:49,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:49,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:49,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:49,800 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 23:39:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:50,173 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 23:39:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:50,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:39:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:50,175 INFO L225 Difference]: With dead ends: 335 [2019-11-15 23:39:50,175 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:39:50,176 INFO L600 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 [2019-11-15 23:39:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:39:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 23:39:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 23:39:50,183 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 23:39:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:50,184 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 23:39:50,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 23:39:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:39:50,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:50,185 INFO L380 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] [2019-11-15 23:39:50,185 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-15 23:39:50,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:50,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507072372] [2019-11-15 23:39:50,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:50,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:50,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:50,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507072372] [2019-11-15 23:39:50,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:50,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:50,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550010478] [2019-11-15 23:39:50,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:50,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:50,244 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 23:39:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:50,581 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 23:39:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:50,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:39:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:50,582 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:39:50,582 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:39:50,583 INFO L600 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 [2019-11-15 23:39:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:39:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:39:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 23:39:50,588 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 23:39:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:50,588 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 23:39:50,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 23:39:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:39:50,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:50,590 INFO L380 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] [2019-11-15 23:39:50,590 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:50,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-15 23:39:50,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:50,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458464375] [2019-11-15 23:39:50,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:50,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:50,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:50,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458464375] [2019-11-15 23:39:50,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:50,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:50,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431951145] [2019-11-15 23:39:50,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:50,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:50,676 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 23:39:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:51,021 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 23:39:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:51,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:39:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:51,023 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:39:51,023 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:39:51,023 INFO L600 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 [2019-11-15 23:39:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:39:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:39:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 23:39:51,028 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 23:39:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:51,028 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 23:39:51,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 23:39:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:39:51,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:51,032 INFO L380 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] [2019-11-15 23:39:51,033 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-15 23:39:51,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:51,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30816701] [2019-11-15 23:39:51,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:51,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30816701] [2019-11-15 23:39:51,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:51,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:51,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374410149] [2019-11-15 23:39:51,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:51,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:51,090 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 23:39:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:51,469 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 23:39:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:51,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 23:39:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:51,471 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:39:51,471 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:39:51,471 INFO L600 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 [2019-11-15 23:39:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:39:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:39:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 23:39:51,476 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 23:39:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:51,476 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 23:39:51,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 23:39:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:39:51,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:51,479 INFO L380 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] [2019-11-15 23:39:51,480 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-15 23:39:51,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:51,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566533139] [2019-11-15 23:39:51,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:51,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566533139] [2019-11-15 23:39:51,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:51,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:51,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576296562] [2019-11-15 23:39:51,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:51,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:51,522 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 23:39:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:51,880 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 23:39:51,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:51,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:39:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:51,882 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:39:51,882 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:39:51,883 INFO L600 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 [2019-11-15 23:39:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:39:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:39:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 23:39:51,887 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 23:39:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:51,888 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 23:39:51,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 23:39:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:39:51,888 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:51,889 INFO L380 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] [2019-11-15 23:39:51,890 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-15 23:39:51,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:51,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352459521] [2019-11-15 23:39:51,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:51,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:39:51,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352459521] [2019-11-15 23:39:51,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:51,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:51,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416397372] [2019-11-15 23:39:51,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:51,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:51,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:51,948 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 23:39:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:52,276 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 23:39:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:52,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 23:39:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:52,278 INFO L225 Difference]: With dead ends: 324 [2019-11-15 23:39:52,278 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 23:39:52,278 INFO L600 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 [2019-11-15 23:39:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 23:39:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 23:39:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:39:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 23:39:52,283 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 23:39:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:52,283 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 23:39:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 23:39:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:39:52,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:52,284 INFO L380 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] [2019-11-15 23:39:52,284 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-15 23:39:52,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:52,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661714982] [2019-11-15 23:39:52,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:52,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661714982] [2019-11-15 23:39:52,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:52,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:52,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60662760] [2019-11-15 23:39:52,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:52,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:52,374 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 23:39:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:52,784 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-15 23:39:52,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:52,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:39:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:52,786 INFO L225 Difference]: With dead ends: 424 [2019-11-15 23:39:52,787 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 23:39:52,787 INFO L600 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 [2019-11-15 23:39:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 23:39:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-15 23:39:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 23:39:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 23:39:52,793 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 23:39:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:52,794 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 23:39:52,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 23:39:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:39:52,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:52,795 INFO L380 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] [2019-11-15 23:39:52,795 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:52,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-15 23:39:52,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:52,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632806389] [2019-11-15 23:39:52,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:52,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:52,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632806389] [2019-11-15 23:39:52,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:52,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:52,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484876176] [2019-11-15 23:39:52,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:52,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:52,848 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 23:39:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:53,217 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 23:39:53,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:53,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:39:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:53,219 INFO L225 Difference]: With dead ends: 427 [2019-11-15 23:39:53,219 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 23:39:53,220 INFO L600 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 [2019-11-15 23:39:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 23:39:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 23:39:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 23:39:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 23:39:53,226 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 23:39:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:53,226 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 23:39:53,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 23:39:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:39:53,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:53,227 INFO L380 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] [2019-11-15 23:39:53,228 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,228 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-15 23:39:53,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22868220] [2019-11-15 23:39:53,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:53,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22868220] [2019-11-15 23:39:53,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:53,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:53,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098915382] [2019-11-15 23:39:53,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:53,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:53,315 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 23:39:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:53,743 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-15 23:39:53,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:53,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 23:39:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:53,745 INFO L225 Difference]: With dead ends: 494 [2019-11-15 23:39:53,745 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:39:53,746 INFO L600 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 [2019-11-15 23:39:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:39:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-15 23:39:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 23:39:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 23:39:53,752 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 23:39:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:53,752 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 23:39:53,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 23:39:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:39:53,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:53,753 INFO L380 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] [2019-11-15 23:39:53,754 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 301633263, now seen corresponding path program 1 times [2019-11-15 23:39:53,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:53,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820513894] [2019-11-15 23:39:53,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:53,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820513894] [2019-11-15 23:39:53,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:53,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:53,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330912042] [2019-11-15 23:39:53,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:53,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:53,824 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 23:39:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:54,283 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-15 23:39:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:54,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 23:39:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:54,286 INFO L225 Difference]: With dead ends: 495 [2019-11-15 23:39:54,286 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:39:54,286 INFO L600 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 [2019-11-15 23:39:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:39:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-15 23:39:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 23:39:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 23:39:54,293 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 81 [2019-11-15 23:39:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 23:39:54,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 23:39:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:39:54,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:54,294 INFO L380 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] [2019-11-15 23:39:54,294 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:54,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 542590269, now seen corresponding path program 1 times [2019-11-15 23:39:54,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:54,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339839424] [2019-11-15 23:39:54,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:54,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:54,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:54,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339839424] [2019-11-15 23:39:54,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:54,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:54,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817866031] [2019-11-15 23:39:54,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:54,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:54,357 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 23:39:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:54,702 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-15 23:39:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:54,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 23:39:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:54,704 INFO L225 Difference]: With dead ends: 497 [2019-11-15 23:39:54,704 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 23:39:54,704 INFO L600 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 [2019-11-15 23:39:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 23:39:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 23:39:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 23:39:54,711 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 82 [2019-11-15 23:39:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:54,711 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 23:39:54,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 23:39:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:39:54,712 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:54,713 INFO L380 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] [2019-11-15 23:39:54,713 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-15 23:39:54,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:54,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629375557] [2019-11-15 23:39:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:54,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:54,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:54,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629375557] [2019-11-15 23:39:54,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:54,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:54,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472296360] [2019-11-15 23:39:54,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:54,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:54,774 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 23:39:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:55,214 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-15 23:39:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:55,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:39:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:55,217 INFO L225 Difference]: With dead ends: 498 [2019-11-15 23:39:55,217 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 23:39:55,217 INFO L600 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 [2019-11-15 23:39:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 23:39:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 23:39:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 23:39:55,223 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 23:39:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:55,224 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 23:39:55,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 23:39:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:39:55,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:55,225 INFO L380 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] [2019-11-15 23:39:55,225 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:55,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-15 23:39:55,226 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:55,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695261451] [2019-11-15 23:39:55,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:55,226 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:55,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:55,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695261451] [2019-11-15 23:39:55,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:55,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:55,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374140832] [2019-11-15 23:39:55,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:55,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:55,299 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 23:39:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:55,613 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 23:39:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:55,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:39:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:55,615 INFO L225 Difference]: With dead ends: 475 [2019-11-15 23:39:55,615 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 23:39:55,615 INFO L600 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 [2019-11-15 23:39:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 23:39:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 23:39:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 23:39:55,621 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 23:39:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:55,621 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 23:39:55,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 23:39:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:55,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:55,623 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:39:55,623 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-15 23:39:55,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:55,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945388142] [2019-11-15 23:39:55,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:55,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:55,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:55,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945388142] [2019-11-15 23:39:55,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:55,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:55,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648193066] [2019-11-15 23:39:55,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:55,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:55,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:55,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:55,686 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 23:39:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:56,175 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 23:39:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:56,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:39:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:56,177 INFO L225 Difference]: With dead ends: 497 [2019-11-15 23:39:56,177 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 23:39:56,178 INFO L600 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 [2019-11-15 23:39:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 23:39:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 23:39:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 23:39:56,182 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 23:39:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:56,182 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 23:39:56,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 23:39:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:56,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:56,184 INFO L380 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] [2019-11-15 23:39:56,184 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-15 23:39:56,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:56,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732959254] [2019-11-15 23:39:56,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:56,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:56,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732959254] [2019-11-15 23:39:56,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:56,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:56,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197635346] [2019-11-15 23:39:56,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:56,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:56,239 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 23:39:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:56,664 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-15 23:39:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:56,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:39:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:56,666 INFO L225 Difference]: With dead ends: 495 [2019-11-15 23:39:56,666 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 23:39:56,667 INFO L600 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 [2019-11-15 23:39:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 23:39:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-15 23:39:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 23:39:56,672 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 23:39:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:56,673 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 23:39:56,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 23:39:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:56,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:56,674 INFO L380 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] [2019-11-15 23:39:56,675 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-15 23:39:56,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:56,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064092336] [2019-11-15 23:39:56,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:56,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:56,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:56,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064092336] [2019-11-15 23:39:56,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:56,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:56,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890852132] [2019-11-15 23:39:56,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:56,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:56,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:56,725 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 23:39:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:57,179 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-15 23:39:57,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:57,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:39:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:57,181 INFO L225 Difference]: With dead ends: 494 [2019-11-15 23:39:57,181 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 23:39:57,181 INFO L600 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 [2019-11-15 23:39:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 23:39:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-15 23:39:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:39:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 23:39:57,187 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 23:39:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:57,187 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 23:39:57,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 23:39:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:57,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:57,188 INFO L380 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] [2019-11-15 23:39:57,188 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-15 23:39:57,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:57,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453558553] [2019-11-15 23:39:57,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:57,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:57,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:39:57,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453558553] [2019-11-15 23:39:57,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:57,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:39:57,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533785238] [2019-11-15 23:39:57,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:39:57,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:39:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:39:57,258 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 23:39:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:57,768 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 23:39:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:39:57,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 23:39:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:57,770 INFO L225 Difference]: With dead ends: 470 [2019-11-15 23:39:57,770 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 23:39:57,771 INFO L600 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 [2019-11-15 23:39:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 23:39:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 23:39:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:39:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 23:39:57,777 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 23:39:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:57,777 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 23:39:57,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:39:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 23:39:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:57,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:57,779 INFO L380 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] [2019-11-15 23:39:57,779 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:57,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-15 23:39:57,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:57,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549209084] [2019-11-15 23:39:57,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:57,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:57,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:57,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549209084] [2019-11-15 23:39:57,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:57,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:57,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413965654] [2019-11-15 23:39:57,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:57,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:57,843 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 23:39:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:58,167 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 23:39:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:58,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:39:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:58,168 INFO L225 Difference]: With dead ends: 512 [2019-11-15 23:39:58,168 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 23:39:58,169 INFO L600 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 [2019-11-15 23:39:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 23:39:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 23:39:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:39:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 23:39:58,175 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 23:39:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:58,176 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 23:39:58,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 23:39:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:39:58,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:58,177 INFO L380 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] [2019-11-15 23:39:58,177 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-15 23:39:58,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:58,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470533601] [2019-11-15 23:39:58,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:58,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:58,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:58,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470533601] [2019-11-15 23:39:58,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:58,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:58,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033282291] [2019-11-15 23:39:58,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:58,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:58,235 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 23:39:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:58,588 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 23:39:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:58,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:39:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:58,590 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:39:58,590 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:39:58,590 INFO L600 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 [2019-11-15 23:39:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:39:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:39:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:39:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 23:39:58,597 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 23:39:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:58,597 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 23:39:58,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 23:39:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:39:58,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:58,599 INFO L380 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] [2019-11-15 23:39:58,599 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-15 23:39:58,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:58,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779004034] [2019-11-15 23:39:58,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:58,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:58,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:58,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779004034] [2019-11-15 23:39:58,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:58,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:58,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770462273] [2019-11-15 23:39:58,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:58,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:58,686 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 23:39:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:59,167 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-15 23:39:59,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:59,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:39:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:59,169 INFO L225 Difference]: With dead ends: 534 [2019-11-15 23:39:59,169 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 23:39:59,170 INFO L600 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 [2019-11-15 23:39:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 23:39:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 23:39:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:39:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 23:39:59,179 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 23:39:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:59,179 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 23:39:59,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 23:39:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:39:59,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:59,181 INFO L380 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] [2019-11-15 23:39:59,181 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-15 23:39:59,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:59,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081993919] [2019-11-15 23:39:59,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:59,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:59,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081993919] [2019-11-15 23:39:59,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:59,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:59,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699594406] [2019-11-15 23:39:59,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:59,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:59,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:59,236 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 23:39:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:39:59,632 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 23:39:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:39:59,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:39:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:39:59,634 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:39:59,635 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:39:59,635 INFO L600 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 [2019-11-15 23:39:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:39:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:39:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:39:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 23:39:59,643 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 23:39:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:39:59,643 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 23:39:59,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:39:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 23:39:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:39:59,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:39:59,645 INFO L380 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] [2019-11-15 23:39:59,645 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:39:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:39:59,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-15 23:39:59,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:39:59,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202468787] [2019-11-15 23:39:59,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:59,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:39:59,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:39:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:39:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:39:59,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202468787] [2019-11-15 23:39:59,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:39:59,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:39:59,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563436972] [2019-11-15 23:39:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:39:59,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:39:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:39:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:39:59,711 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 23:40:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:00,064 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-15 23:40:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:00,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:40:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:00,066 INFO L225 Difference]: With dead ends: 534 [2019-11-15 23:40:00,066 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 23:40:00,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 23:40:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 23:40:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 23:40:00,073 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 23:40:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:00,073 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 23:40:00,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 23:40:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:40:00,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:00,074 INFO L380 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] [2019-11-15 23:40:00,074 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-15 23:40:00,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:00,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916598089] [2019-11-15 23:40:00,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:00,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916598089] [2019-11-15 23:40:00,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:00,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:00,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912246518] [2019-11-15 23:40:00,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:00,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:00,137 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 23:40:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:00,461 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 23:40:00,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:00,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:40:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:00,463 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:40:00,463 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:40:00,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:40:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:40:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 23:40:00,470 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 23:40:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:00,470 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 23:40:00,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 23:40:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:40:00,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:00,471 INFO L380 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] [2019-11-15 23:40:00,471 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:00,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-15 23:40:00,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:00,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731534214] [2019-11-15 23:40:00,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:00,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731534214] [2019-11-15 23:40:00,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:00,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:00,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214434949] [2019-11-15 23:40:00,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:00,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:00,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:00,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:00,519 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 23:40:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:00,880 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-15 23:40:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:00,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:40:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:00,882 INFO L225 Difference]: With dead ends: 534 [2019-11-15 23:40:00,882 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 23:40:00,883 INFO L600 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 [2019-11-15 23:40:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 23:40:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 23:40:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 23:40:00,889 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 23:40:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 23:40:00,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 23:40:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:40:00,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:00,891 INFO L380 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] [2019-11-15 23:40:00,891 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:00,892 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-15 23:40:00,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:00,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219107123] [2019-11-15 23:40:00,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:00,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:00,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219107123] [2019-11-15 23:40:00,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:00,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:00,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508225485] [2019-11-15 23:40:00,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:00,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:00,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:00,957 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 23:40:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:01,311 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 23:40:01,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:01,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:40:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:01,313 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:40:01,314 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:40:01,314 INFO L600 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 [2019-11-15 23:40:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:40:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:40:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 23:40:01,320 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 23:40:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:01,321 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 23:40:01,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 23:40:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:40:01,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:01,323 INFO L380 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] [2019-11-15 23:40:01,323 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-15 23:40:01,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:01,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382133935] [2019-11-15 23:40:01,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:01,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:01,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:01,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382133935] [2019-11-15 23:40:01,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:01,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:01,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037069400] [2019-11-15 23:40:01,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:01,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:01,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:01,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:01,390 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 23:40:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:01,666 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-15 23:40:01,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:01,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:40:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:01,668 INFO L225 Difference]: With dead ends: 524 [2019-11-15 23:40:01,668 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:40:01,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:40:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 23:40:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 23:40:01,677 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 23:40:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:01,677 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 23:40:01,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 23:40:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:40:01,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:01,678 INFO L380 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] [2019-11-15 23:40:01,679 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-15 23:40:01,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:01,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065715400] [2019-11-15 23:40:01,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:01,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:01,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065715400] [2019-11-15 23:40:01,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:01,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:01,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808122942] [2019-11-15 23:40:01,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:01,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:01,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:01,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:01,763 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 23:40:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:02,128 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 23:40:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:02,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:40:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:02,130 INFO L225 Difference]: With dead ends: 501 [2019-11-15 23:40:02,130 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 23:40:02,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 23:40:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 23:40:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 23:40:02,137 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 23:40:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:02,138 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 23:40:02,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 23:40:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:02,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:02,139 INFO L380 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] [2019-11-15 23:40:02,139 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-15 23:40:02,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:02,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496557144] [2019-11-15 23:40:02,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:40:02,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496557144] [2019-11-15 23:40:02,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:02,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:02,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85427593] [2019-11-15 23:40:02,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:02,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:02,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:02,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:02,193 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 23:40:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:02,621 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-15 23:40:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:02,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:40:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:02,624 INFO L225 Difference]: With dead ends: 524 [2019-11-15 23:40:02,624 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 23:40:02,624 INFO L600 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 [2019-11-15 23:40:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 23:40:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 23:40:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:40:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 23:40:02,631 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 23:40:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:02,632 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 23:40:02,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 23:40:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:40:02,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:02,633 INFO L380 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] [2019-11-15 23:40:02,633 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-15 23:40:02,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:02,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641866865] [2019-11-15 23:40:02,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:40:02,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641866865] [2019-11-15 23:40:02,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:02,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:02,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072673813] [2019-11-15 23:40:02,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:02,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:02,683 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 23:40:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:02,733 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 23:40:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:02,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 23:40:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:02,736 INFO L225 Difference]: With dead ends: 722 [2019-11-15 23:40:02,736 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 23:40:02,737 INFO L600 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 [2019-11-15 23:40:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 23:40:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 23:40:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 23:40:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 23:40:02,751 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 23:40:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:02,752 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 23:40:02,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 23:40:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:40:02,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:02,753 INFO L380 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] [2019-11-15 23:40:02,754 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-15 23:40:02,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:02,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101571569] [2019-11-15 23:40:02,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:40:02,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101571569] [2019-11-15 23:40:02,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:02,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:02,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646328601] [2019-11-15 23:40:02,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:02,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:02,808 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 23:40:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:02,866 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 23:40:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:02,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 23:40:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:02,870 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 23:40:02,870 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 23:40:02,871 INFO L600 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 [2019-11-15 23:40:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 23:40:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 23:40:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 23:40:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 23:40:02,889 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 23:40:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 23:40:02,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 23:40:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 23:40:02,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:02,891 INFO L380 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] [2019-11-15 23:40:02,892 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:02,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1825940577, now seen corresponding path program 1 times [2019-11-15 23:40:02,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:02,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811153334] [2019-11-15 23:40:02,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:02,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:40:02,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811153334] [2019-11-15 23:40:02,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:02,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:02,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718247709] [2019-11-15 23:40:02,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:02,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:02,948 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 23:40:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:03,043 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 23:40:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:03,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-15 23:40:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:03,048 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 23:40:03,048 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 23:40:03,050 INFO L600 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 [2019-11-15 23:40:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 23:40:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 23:40:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 23:40:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 23:40:03,074 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 105 [2019-11-15 23:40:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:03,075 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 23:40:03,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 23:40:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:40:03,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:03,078 INFO L380 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] [2019-11-15 23:40:03,078 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash 315775349, now seen corresponding path program 1 times [2019-11-15 23:40:03,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:03,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395954143] [2019-11-15 23:40:03,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:40:03,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395954143] [2019-11-15 23:40:03,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:03,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:03,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933397296] [2019-11-15 23:40:03,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:03,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:03,144 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 23:40:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:03,220 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 23:40:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:03,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-15 23:40:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:03,226 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 23:40:03,226 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 23:40:03,227 INFO L600 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 [2019-11-15 23:40:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 23:40:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 23:40:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 23:40:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 23:40:03,257 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 122 [2019-11-15 23:40:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 23:40:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 23:40:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 23:40:03,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:03,261 INFO L380 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] [2019-11-15 23:40:03,261 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-15 23:40:03,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:03,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030191341] [2019-11-15 23:40:03,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:40:03,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030191341] [2019-11-15 23:40:03,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:03,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:03,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610608487] [2019-11-15 23:40:03,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:03,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:03,316 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-15 23:40:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:03,375 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-15 23:40:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:03,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 23:40:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:03,382 INFO L225 Difference]: With dead ends: 1423 [2019-11-15 23:40:03,382 INFO L226 Difference]: Without dead ends: 1421 [2019-11-15 23:40:03,383 INFO L600 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 [2019-11-15 23:40:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-15 23:40:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-15 23:40:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 23:40:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-15 23:40:03,421 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-15 23:40:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:03,421 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-15 23:40:03,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-15 23:40:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 23:40:03,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:03,425 INFO L380 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] [2019-11-15 23:40:03,425 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2031804581, now seen corresponding path program 1 times [2019-11-15 23:40:03,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:03,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725800480] [2019-11-15 23:40:03,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 23:40:03,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725800480] [2019-11-15 23:40:03,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:03,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:40:03,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787225840] [2019-11-15 23:40:03,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:40:03,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:03,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:40:03,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:40:03,495 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 3 states. [2019-11-15 23:40:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:03,597 INFO L93 Difference]: Finished difference Result 3046 states and 4490 transitions. [2019-11-15 23:40:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:40:03,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 23:40:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:03,605 INFO L225 Difference]: With dead ends: 3046 [2019-11-15 23:40:03,605 INFO L226 Difference]: Without dead ends: 1646 [2019-11-15 23:40:03,607 INFO L600 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 [2019-11-15 23:40:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-15 23:40:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-11-15 23:40:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-11-15 23:40:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2419 transitions. [2019-11-15 23:40:03,649 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2419 transitions. Word has length 165 [2019-11-15 23:40:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:03,650 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 2419 transitions. [2019-11-15 23:40:03,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:40:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2419 transitions. [2019-11-15 23:40:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 23:40:03,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:03,654 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:03,654 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1561325293, now seen corresponding path program 1 times [2019-11-15 23:40:03,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:03,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141470277] [2019-11-15 23:40:03,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:03,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:40:03,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141470277] [2019-11-15 23:40:03,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:03,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:03,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298312185] [2019-11-15 23:40:03,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:03,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:03,765 INFO L87 Difference]: Start difference. First operand 1646 states and 2419 transitions. Second operand 4 states. [2019-11-15 23:40:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:04,240 INFO L93 Difference]: Finished difference Result 3714 states and 5490 transitions. [2019-11-15 23:40:04,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:04,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-15 23:40:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:04,251 INFO L225 Difference]: With dead ends: 3714 [2019-11-15 23:40:04,251 INFO L226 Difference]: Without dead ends: 2087 [2019-11-15 23:40:04,253 INFO L600 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 [2019-11-15 23:40:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-11-15 23:40:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1842. [2019-11-15 23:40:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2762 transitions. [2019-11-15 23:40:04,298 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2762 transitions. Word has length 168 [2019-11-15 23:40:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:04,299 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2762 transitions. [2019-11-15 23:40:04,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2762 transitions. [2019-11-15 23:40:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 23:40:04,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:04,303 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 23:40:04,303 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -274982883, now seen corresponding path program 1 times [2019-11-15 23:40:04,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:04,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535922132] [2019-11-15 23:40:04,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:04,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:04,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:04,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535922132] [2019-11-15 23:40:04,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:04,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:04,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466270028] [2019-11-15 23:40:04,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:04,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:04,385 INFO L87 Difference]: Start difference. First operand 1842 states and 2762 transitions. Second operand 4 states. [2019-11-15 23:40:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:04,806 INFO L93 Difference]: Finished difference Result 3910 states and 5826 transitions. [2019-11-15 23:40:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:04,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 23:40:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:04,817 INFO L225 Difference]: With dead ends: 3910 [2019-11-15 23:40:04,817 INFO L226 Difference]: Without dead ends: 2087 [2019-11-15 23:40:04,820 INFO L600 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 [2019-11-15 23:40:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2019-11-15 23:40:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1842. [2019-11-15 23:40:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2755 transitions. [2019-11-15 23:40:04,864 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2755 transitions. Word has length 181 [2019-11-15 23:40:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:04,865 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2755 transitions. [2019-11-15 23:40:04,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:04,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2755 transitions. [2019-11-15 23:40:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 23:40:04,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:04,869 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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] [2019-11-15 23:40:04,870 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash -454643802, now seen corresponding path program 1 times [2019-11-15 23:40:04,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:04,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257639282] [2019-11-15 23:40:04,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:04,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:04,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:04,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257639282] [2019-11-15 23:40:04,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:04,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:04,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371493485] [2019-11-15 23:40:04,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:04,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:04,954 INFO L87 Difference]: Start difference. First operand 1842 states and 2755 transitions. Second operand 4 states. [2019-11-15 23:40:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:05,329 INFO L93 Difference]: Finished difference Result 3896 states and 5798 transitions. [2019-11-15 23:40:05,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:05,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 23:40:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:05,340 INFO L225 Difference]: With dead ends: 3896 [2019-11-15 23:40:05,340 INFO L226 Difference]: Without dead ends: 2073 [2019-11-15 23:40:05,343 INFO L600 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 [2019-11-15 23:40:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2019-11-15 23:40:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 1842. [2019-11-15 23:40:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2748 transitions. [2019-11-15 23:40:05,387 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2748 transitions. Word has length 182 [2019-11-15 23:40:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:05,388 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2748 transitions. [2019-11-15 23:40:05,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2748 transitions. [2019-11-15 23:40:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 23:40:05,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:05,392 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:05,392 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1868816486, now seen corresponding path program 1 times [2019-11-15 23:40:05,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:05,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116368678] [2019-11-15 23:40:05,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:05,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:05,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116368678] [2019-11-15 23:40:05,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:05,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:05,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168162098] [2019-11-15 23:40:05,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:05,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:05,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:05,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:05,473 INFO L87 Difference]: Start difference. First operand 1842 states and 2748 transitions. Second operand 4 states. [2019-11-15 23:40:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:05,798 INFO L93 Difference]: Finished difference Result 3889 states and 5777 transitions. [2019-11-15 23:40:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:05,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 23:40:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:05,809 INFO L225 Difference]: With dead ends: 3889 [2019-11-15 23:40:05,809 INFO L226 Difference]: Without dead ends: 2066 [2019-11-15 23:40:05,811 INFO L600 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 [2019-11-15 23:40:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-11-15 23:40:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1842. [2019-11-15 23:40:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2741 transitions. [2019-11-15 23:40:05,854 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2741 transitions. Word has length 182 [2019-11-15 23:40:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:05,855 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2741 transitions. [2019-11-15 23:40:05,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2741 transitions. [2019-11-15 23:40:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 23:40:05,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:05,858 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:05,858 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1181838367, now seen corresponding path program 1 times [2019-11-15 23:40:05,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:05,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545972807] [2019-11-15 23:40:05,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:05,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:05,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:05,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545972807] [2019-11-15 23:40:05,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:05,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:05,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315963776] [2019-11-15 23:40:05,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:05,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:05,944 INFO L87 Difference]: Start difference. First operand 1842 states and 2741 transitions. Second operand 4 states. [2019-11-15 23:40:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:06,457 INFO L93 Difference]: Finished difference Result 3889 states and 5763 transitions. [2019-11-15 23:40:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:06,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 23:40:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:06,478 INFO L225 Difference]: With dead ends: 3889 [2019-11-15 23:40:06,485 INFO L226 Difference]: Without dead ends: 2066 [2019-11-15 23:40:06,487 INFO L600 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 [2019-11-15 23:40:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-11-15 23:40:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1842. [2019-11-15 23:40:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2734 transitions. [2019-11-15 23:40:06,523 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2734 transitions. Word has length 183 [2019-11-15 23:40:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:06,523 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2734 transitions. [2019-11-15 23:40:06,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2734 transitions. [2019-11-15 23:40:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:40:06,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:06,527 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:06,527 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1946881046, now seen corresponding path program 1 times [2019-11-15 23:40:06,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:06,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342117841] [2019-11-15 23:40:06,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:06,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:06,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:06,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342117841] [2019-11-15 23:40:06,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:06,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:06,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805840601] [2019-11-15 23:40:06,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:06,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:06,601 INFO L87 Difference]: Start difference. First operand 1842 states and 2734 transitions. Second operand 4 states. [2019-11-15 23:40:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:07,017 INFO L93 Difference]: Finished difference Result 3889 states and 5749 transitions. [2019-11-15 23:40:07,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:07,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 23:40:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:07,021 INFO L225 Difference]: With dead ends: 3889 [2019-11-15 23:40:07,021 INFO L226 Difference]: Without dead ends: 2066 [2019-11-15 23:40:07,023 INFO L600 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 [2019-11-15 23:40:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-11-15 23:40:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1842. [2019-11-15 23:40:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2727 transitions. [2019-11-15 23:40:07,063 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2727 transitions. Word has length 184 [2019-11-15 23:40:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:07,063 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2727 transitions. [2019-11-15 23:40:07,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2727 transitions. [2019-11-15 23:40:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 23:40:07,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:07,067 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:07,067 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1756971782, now seen corresponding path program 1 times [2019-11-15 23:40:07,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:07,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70929958] [2019-11-15 23:40:07,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:07,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70929958] [2019-11-15 23:40:07,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:07,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:07,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417519160] [2019-11-15 23:40:07,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:07,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:07,148 INFO L87 Difference]: Start difference. First operand 1842 states and 2727 transitions. Second operand 4 states. [2019-11-15 23:40:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:07,505 INFO L93 Difference]: Finished difference Result 3889 states and 5735 transitions. [2019-11-15 23:40:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:07,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 23:40:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:07,508 INFO L225 Difference]: With dead ends: 3889 [2019-11-15 23:40:07,508 INFO L226 Difference]: Without dead ends: 2066 [2019-11-15 23:40:07,510 INFO L600 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 [2019-11-15 23:40:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-11-15 23:40:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1842. [2019-11-15 23:40:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2720 transitions. [2019-11-15 23:40:07,543 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2720 transitions. Word has length 185 [2019-11-15 23:40:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:07,543 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2720 transitions. [2019-11-15 23:40:07,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2720 transitions. [2019-11-15 23:40:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:40:07,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:07,546 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:07,546 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2032302737, now seen corresponding path program 1 times [2019-11-15 23:40:07,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:07,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122846212] [2019-11-15 23:40:07,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:07,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122846212] [2019-11-15 23:40:07,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:07,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:07,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138566719] [2019-11-15 23:40:07,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:07,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:07,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:07,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:07,625 INFO L87 Difference]: Start difference. First operand 1842 states and 2720 transitions. Second operand 4 states. [2019-11-15 23:40:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:07,929 INFO L93 Difference]: Finished difference Result 3819 states and 5637 transitions. [2019-11-15 23:40:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:07,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 23:40:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:07,932 INFO L225 Difference]: With dead ends: 3819 [2019-11-15 23:40:07,932 INFO L226 Difference]: Without dead ends: 1996 [2019-11-15 23:40:07,935 INFO L600 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 [2019-11-15 23:40:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-15 23:40:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1842. [2019-11-15 23:40:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2713 transitions. [2019-11-15 23:40:07,973 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2713 transitions. Word has length 186 [2019-11-15 23:40:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:07,973 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2713 transitions. [2019-11-15 23:40:07,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2713 transitions. [2019-11-15 23:40:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 23:40:07,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:07,977 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:07,977 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1451855529, now seen corresponding path program 1 times [2019-11-15 23:40:07,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:07,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947239831] [2019-11-15 23:40:07,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:07,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:08,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947239831] [2019-11-15 23:40:08,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:08,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:08,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515543569] [2019-11-15 23:40:08,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:08,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:08,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:08,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:08,059 INFO L87 Difference]: Start difference. First operand 1842 states and 2713 transitions. Second operand 4 states. [2019-11-15 23:40:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:08,608 INFO L93 Difference]: Finished difference Result 3819 states and 5623 transitions. [2019-11-15 23:40:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:08,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 23:40:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:08,612 INFO L225 Difference]: With dead ends: 3819 [2019-11-15 23:40:08,612 INFO L226 Difference]: Without dead ends: 1996 [2019-11-15 23:40:08,614 INFO L600 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 [2019-11-15 23:40:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-15 23:40:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1842. [2019-11-15 23:40:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2706 transitions. [2019-11-15 23:40:08,646 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2706 transitions. Word has length 190 [2019-11-15 23:40:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:08,646 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2706 transitions. [2019-11-15 23:40:08,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2706 transitions. [2019-11-15 23:40:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 23:40:08,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:08,649 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2019-11-15 23:40:08,649 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1747468608, now seen corresponding path program 1 times [2019-11-15 23:40:08,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:08,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49723927] [2019-11-15 23:40:08,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:08,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:08,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:40:08,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49723927] [2019-11-15 23:40:08,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:08,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:08,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738014672] [2019-11-15 23:40:08,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:08,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:08,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:08,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:08,733 INFO L87 Difference]: Start difference. First operand 1842 states and 2706 transitions. Second operand 4 states. [2019-11-15 23:40:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:09,021 INFO L93 Difference]: Finished difference Result 3784 states and 5564 transitions. [2019-11-15 23:40:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:09,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 23:40:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:09,025 INFO L225 Difference]: With dead ends: 3784 [2019-11-15 23:40:09,025 INFO L226 Difference]: Without dead ends: 1961 [2019-11-15 23:40:09,027 INFO L600 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 [2019-11-15 23:40:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-11-15 23:40:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1842. [2019-11-15 23:40:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-11-15 23:40:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2699 transitions. [2019-11-15 23:40:09,065 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2699 transitions. Word has length 191 [2019-11-15 23:40:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:09,066 INFO L462 AbstractCegarLoop]: Abstraction has 1842 states and 2699 transitions. [2019-11-15 23:40:09,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2699 transitions. [2019-11-15 23:40:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 23:40:09,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:09,069 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:09,070 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash 976830751, now seen corresponding path program 1 times [2019-11-15 23:40:09,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:09,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29140705] [2019-11-15 23:40:09,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:40:09,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29140705] [2019-11-15 23:40:09,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:09,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:09,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542976698] [2019-11-15 23:40:09,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:09,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:09,157 INFO L87 Difference]: Start difference. First operand 1842 states and 2699 transitions. Second operand 4 states. [2019-11-15 23:40:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:09,503 INFO L93 Difference]: Finished difference Result 4134 states and 6092 transitions. [2019-11-15 23:40:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:09,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 23:40:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:09,508 INFO L225 Difference]: With dead ends: 4134 [2019-11-15 23:40:09,508 INFO L226 Difference]: Without dead ends: 2311 [2019-11-15 23:40:09,510 INFO L600 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 [2019-11-15 23:40:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-11-15 23:40:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2052. [2019-11-15 23:40:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-15 23:40:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3070 transitions. [2019-11-15 23:40:09,554 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3070 transitions. Word has length 193 [2019-11-15 23:40:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:09,554 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3070 transitions. [2019-11-15 23:40:09,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3070 transitions. [2019-11-15 23:40:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 23:40:09,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:09,558 INFO L380 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, 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] [2019-11-15 23:40:09,559 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 40133602, now seen corresponding path program 1 times [2019-11-15 23:40:09,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:09,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532131222] [2019-11-15 23:40:09,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:09,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532131222] [2019-11-15 23:40:09,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:09,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:09,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436855622] [2019-11-15 23:40:09,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:09,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:09,673 INFO L87 Difference]: Start difference. First operand 2052 states and 3070 transitions. Second operand 4 states. [2019-11-15 23:40:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:10,166 INFO L93 Difference]: Finished difference Result 4797 states and 7193 transitions. [2019-11-15 23:40:10,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:10,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 23:40:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:10,171 INFO L225 Difference]: With dead ends: 4797 [2019-11-15 23:40:10,171 INFO L226 Difference]: Without dead ends: 2764 [2019-11-15 23:40:10,174 INFO L600 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 [2019-11-15 23:40:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2019-11-15 23:40:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2248. [2019-11-15 23:40:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-11-15 23:40:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3413 transitions. [2019-11-15 23:40:10,224 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3413 transitions. Word has length 199 [2019-11-15 23:40:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:10,224 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 3413 transitions. [2019-11-15 23:40:10,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3413 transitions. [2019-11-15 23:40:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-15 23:40:10,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:10,229 INFO L380 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, 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] [2019-11-15 23:40:10,229 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -662187671, now seen corresponding path program 1 times [2019-11-15 23:40:10,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:10,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885172321] [2019-11-15 23:40:10,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:10,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885172321] [2019-11-15 23:40:10,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:10,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:10,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556231642] [2019-11-15 23:40:10,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:10,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:10,345 INFO L87 Difference]: Start difference. First operand 2248 states and 3413 transitions. Second operand 4 states. [2019-11-15 23:40:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:10,779 INFO L93 Difference]: Finished difference Result 4937 states and 7438 transitions. [2019-11-15 23:40:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:10,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-15 23:40:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:10,783 INFO L225 Difference]: With dead ends: 4937 [2019-11-15 23:40:10,783 INFO L226 Difference]: Without dead ends: 2708 [2019-11-15 23:40:10,786 INFO L600 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 [2019-11-15 23:40:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-11-15 23:40:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2255. [2019-11-15 23:40:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-11-15 23:40:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3420 transitions. [2019-11-15 23:40:10,850 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3420 transitions. Word has length 200 [2019-11-15 23:40:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:10,850 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 3420 transitions. [2019-11-15 23:40:10,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3420 transitions. [2019-11-15 23:40:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 23:40:10,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:10,855 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:10,856 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 79230548, now seen corresponding path program 1 times [2019-11-15 23:40:10,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:10,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964129935] [2019-11-15 23:40:10,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 23:40:11,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964129935] [2019-11-15 23:40:11,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:11,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:11,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021904167] [2019-11-15 23:40:11,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:11,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:11,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:11,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:11,040 INFO L87 Difference]: Start difference. First operand 2255 states and 3420 transitions. Second operand 4 states. [2019-11-15 23:40:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:11,475 INFO L93 Difference]: Finished difference Result 4944 states and 7438 transitions. [2019-11-15 23:40:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:11,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-11-15 23:40:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:11,478 INFO L225 Difference]: With dead ends: 4944 [2019-11-15 23:40:11,478 INFO L226 Difference]: Without dead ends: 2708 [2019-11-15 23:40:11,480 INFO L600 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 [2019-11-15 23:40:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-11-15 23:40:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2325. [2019-11-15 23:40:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2325 states. [2019-11-15 23:40:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 3553 transitions. [2019-11-15 23:40:11,528 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 3553 transitions. Word has length 204 [2019-11-15 23:40:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:11,529 INFO L462 AbstractCegarLoop]: Abstraction has 2325 states and 3553 transitions. [2019-11-15 23:40:11,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 3553 transitions. [2019-11-15 23:40:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-15 23:40:11,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:11,533 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:11,533 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2056926600, now seen corresponding path program 1 times [2019-11-15 23:40:11,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:11,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915281551] [2019-11-15 23:40:11,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:11,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:11,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 23:40:11,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915281551] [2019-11-15 23:40:11,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:11,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:11,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794346574] [2019-11-15 23:40:11,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:11,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:11,653 INFO L87 Difference]: Start difference. First operand 2325 states and 3553 transitions. Second operand 4 states. [2019-11-15 23:40:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:12,088 INFO L93 Difference]: Finished difference Result 4974 states and 7515 transitions. [2019-11-15 23:40:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:12,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2019-11-15 23:40:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:12,091 INFO L225 Difference]: With dead ends: 4974 [2019-11-15 23:40:12,091 INFO L226 Difference]: Without dead ends: 2668 [2019-11-15 23:40:12,094 INFO L600 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 [2019-11-15 23:40:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-11-15 23:40:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2220. [2019-11-15 23:40:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2019-11-15 23:40:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3364 transitions. [2019-11-15 23:40:12,144 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3364 transitions. Word has length 205 [2019-11-15 23:40:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:12,144 INFO L462 AbstractCegarLoop]: Abstraction has 2220 states and 3364 transitions. [2019-11-15 23:40:12,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3364 transitions. [2019-11-15 23:40:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 23:40:12,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:12,149 INFO L380 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, 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] [2019-11-15 23:40:12,149 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash -237510736, now seen corresponding path program 1 times [2019-11-15 23:40:12,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:12,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456870723] [2019-11-15 23:40:12,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:12,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:12,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:12,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456870723] [2019-11-15 23:40:12,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:12,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:12,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416081934] [2019-11-15 23:40:12,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:12,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:12,261 INFO L87 Difference]: Start difference. First operand 2220 states and 3364 transitions. Second operand 4 states. [2019-11-15 23:40:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:12,638 INFO L93 Difference]: Finished difference Result 4869 states and 7319 transitions. [2019-11-15 23:40:12,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:12,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-15 23:40:12,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:12,640 INFO L225 Difference]: With dead ends: 4869 [2019-11-15 23:40:12,640 INFO L226 Difference]: Without dead ends: 2668 [2019-11-15 23:40:12,642 INFO L600 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 [2019-11-15 23:40:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-11-15 23:40:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2220. [2019-11-15 23:40:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2019-11-15 23:40:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3357 transitions. [2019-11-15 23:40:12,690 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3357 transitions. Word has length 212 [2019-11-15 23:40:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:12,690 INFO L462 AbstractCegarLoop]: Abstraction has 2220 states and 3357 transitions. [2019-11-15 23:40:12,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3357 transitions. [2019-11-15 23:40:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 23:40:12,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:12,694 INFO L380 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, 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] [2019-11-15 23:40:12,695 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 776550729, now seen corresponding path program 1 times [2019-11-15 23:40:12,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:12,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513723350] [2019-11-15 23:40:12,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:12,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:12,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:12,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513723350] [2019-11-15 23:40:12,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:12,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:12,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800237934] [2019-11-15 23:40:12,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:12,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:12,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:12,815 INFO L87 Difference]: Start difference. First operand 2220 states and 3357 transitions. Second operand 4 states. [2019-11-15 23:40:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:13,323 INFO L93 Difference]: Finished difference Result 5133 states and 7767 transitions. [2019-11-15 23:40:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:13,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2019-11-15 23:40:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:13,326 INFO L225 Difference]: With dead ends: 5133 [2019-11-15 23:40:13,326 INFO L226 Difference]: Without dead ends: 2932 [2019-11-15 23:40:13,328 INFO L600 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 [2019-11-15 23:40:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2019-11-15 23:40:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2416. [2019-11-15 23:40:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-11-15 23:40:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3700 transitions. [2019-11-15 23:40:13,366 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3700 transitions. Word has length 213 [2019-11-15 23:40:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:13,367 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 3700 transitions. [2019-11-15 23:40:13,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3700 transitions. [2019-11-15 23:40:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 23:40:13,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:13,370 INFO L380 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, 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] [2019-11-15 23:40:13,370 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:13,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 691906786, now seen corresponding path program 1 times [2019-11-15 23:40:13,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:13,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571051595] [2019-11-15 23:40:13,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:13,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571051595] [2019-11-15 23:40:13,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:13,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:13,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393400533] [2019-11-15 23:40:13,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:13,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:13,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:13,479 INFO L87 Difference]: Start difference. First operand 2416 states and 3700 transitions. Second operand 4 states. [2019-11-15 23:40:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:13,947 INFO L93 Difference]: Finished difference Result 5273 states and 8012 transitions. [2019-11-15 23:40:13,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:13,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 23:40:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:13,950 INFO L225 Difference]: With dead ends: 5273 [2019-11-15 23:40:13,950 INFO L226 Difference]: Without dead ends: 2876 [2019-11-15 23:40:13,952 INFO L600 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 [2019-11-15 23:40:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2019-11-15 23:40:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2423. [2019-11-15 23:40:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-11-15 23:40:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3707 transitions. [2019-11-15 23:40:13,989 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3707 transitions. Word has length 214 [2019-11-15 23:40:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:13,990 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3707 transitions. [2019-11-15 23:40:13,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3707 transitions. [2019-11-15 23:40:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 23:40:13,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:13,993 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:13,993 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash 786214828, now seen corresponding path program 1 times [2019-11-15 23:40:13,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:13,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044017130] [2019-11-15 23:40:13,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:13,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:14,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044017130] [2019-11-15 23:40:14,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:14,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:14,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935637998] [2019-11-15 23:40:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:14,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:14,094 INFO L87 Difference]: Start difference. First operand 2423 states and 3707 transitions. Second operand 4 states. [2019-11-15 23:40:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:14,657 INFO L93 Difference]: Finished difference Result 5275 states and 8005 transitions. [2019-11-15 23:40:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:14,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 23:40:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:14,661 INFO L225 Difference]: With dead ends: 5275 [2019-11-15 23:40:14,661 INFO L226 Difference]: Without dead ends: 2871 [2019-11-15 23:40:14,664 INFO L600 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 [2019-11-15 23:40:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-11-15 23:40:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2423. [2019-11-15 23:40:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-11-15 23:40:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3700 transitions. [2019-11-15 23:40:14,721 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3700 transitions. Word has length 214 [2019-11-15 23:40:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:14,721 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3700 transitions. [2019-11-15 23:40:14,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3700 transitions. [2019-11-15 23:40:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 23:40:14,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:14,726 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:14,726 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1724323771, now seen corresponding path program 1 times [2019-11-15 23:40:14,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:14,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459680700] [2019-11-15 23:40:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:14,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:14,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:14,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459680700] [2019-11-15 23:40:14,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:14,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:14,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001181411] [2019-11-15 23:40:14,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:14,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:14,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:14,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:14,831 INFO L87 Difference]: Start difference. First operand 2423 states and 3700 transitions. Second operand 4 states. [2019-11-15 23:40:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:15,347 INFO L93 Difference]: Finished difference Result 5275 states and 7991 transitions. [2019-11-15 23:40:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:15,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-11-15 23:40:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:15,350 INFO L225 Difference]: With dead ends: 5275 [2019-11-15 23:40:15,350 INFO L226 Difference]: Without dead ends: 2871 [2019-11-15 23:40:15,352 INFO L600 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 [2019-11-15 23:40:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-11-15 23:40:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2423. [2019-11-15 23:40:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-11-15 23:40:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3693 transitions. [2019-11-15 23:40:15,394 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3693 transitions. Word has length 215 [2019-11-15 23:40:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:15,394 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3693 transitions. [2019-11-15 23:40:15,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3693 transitions. [2019-11-15 23:40:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 23:40:15,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:15,399 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:15,399 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:15,399 INFO L82 PathProgramCache]: Analyzing trace with hash 771323687, now seen corresponding path program 1 times [2019-11-15 23:40:15,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:15,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625573461] [2019-11-15 23:40:15,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:15,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625573461] [2019-11-15 23:40:15,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:15,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:15,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447806690] [2019-11-15 23:40:15,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:15,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:15,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:15,508 INFO L87 Difference]: Start difference. First operand 2423 states and 3693 transitions. Second operand 4 states. [2019-11-15 23:40:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:15,934 INFO L93 Difference]: Finished difference Result 5275 states and 7977 transitions. [2019-11-15 23:40:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:15,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-11-15 23:40:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:15,937 INFO L225 Difference]: With dead ends: 5275 [2019-11-15 23:40:15,937 INFO L226 Difference]: Without dead ends: 2871 [2019-11-15 23:40:15,939 INFO L600 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 [2019-11-15 23:40:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-11-15 23:40:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2423. [2019-11-15 23:40:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-11-15 23:40:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3686 transitions. [2019-11-15 23:40:15,991 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3686 transitions. Word has length 216 [2019-11-15 23:40:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:15,992 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3686 transitions. [2019-11-15 23:40:15,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3686 transitions. [2019-11-15 23:40:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 23:40:15,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:15,996 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:15,996 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -455051040, now seen corresponding path program 1 times [2019-11-15 23:40:15,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:15,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878053502] [2019-11-15 23:40:15,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:16,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878053502] [2019-11-15 23:40:16,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:16,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:16,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143162528] [2019-11-15 23:40:16,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:16,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:16,174 INFO L87 Difference]: Start difference. First operand 2423 states and 3686 transitions. Second operand 4 states. [2019-11-15 23:40:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:16,554 INFO L93 Difference]: Finished difference Result 5205 states and 7879 transitions. [2019-11-15 23:40:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:16,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-15 23:40:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:16,556 INFO L225 Difference]: With dead ends: 5205 [2019-11-15 23:40:16,556 INFO L226 Difference]: Without dead ends: 2801 [2019-11-15 23:40:16,558 INFO L600 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 [2019-11-15 23:40:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-11-15 23:40:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2423. [2019-11-15 23:40:16,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-11-15 23:40:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 3679 transitions. [2019-11-15 23:40:16,598 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 3679 transitions. Word has length 217 [2019-11-15 23:40:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:16,598 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 3679 transitions. [2019-11-15 23:40:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 3679 transitions. [2019-11-15 23:40:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 23:40:16,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:16,601 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:16,602 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2125373517, now seen corresponding path program 1 times [2019-11-15 23:40:16,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:16,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917300263] [2019-11-15 23:40:16,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:16,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:16,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 152 proven. 8 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 23:40:16,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917300263] [2019-11-15 23:40:16,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031503928] [2019-11-15 23:40:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:16,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:17,030 INFO L375 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 8 [2019-11-15 23:40:17,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:17,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:17,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-11-15 23:40:17,049 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:40:17,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:17,068 INFO L375 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 62 treesize of output 38 [2019-11-15 23:40:17,068 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:40:17,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:17,172 INFO L341 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-15 23:40:17,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-15 23:40:17,173 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,233 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-15 23:40:17,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,236 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-15 23:40:17,267 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:17,267 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:17,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:17,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:17,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 152 proven. 8 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-11-15 23:40:17,344 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:17,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 23:40:17,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274326165] [2019-11-15 23:40:17,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:17,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:17,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:17,346 INFO L87 Difference]: Start difference. First operand 2423 states and 3679 transitions. Second operand 9 states. [2019-11-15 23:40:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:19,324 INFO L93 Difference]: Finished difference Result 7034 states and 10653 transitions. [2019-11-15 23:40:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:40:19,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-11-15 23:40:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:19,332 INFO L225 Difference]: With dead ends: 7034 [2019-11-15 23:40:19,332 INFO L226 Difference]: Without dead ends: 4630 [2019-11-15 23:40:19,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:40:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2019-11-15 23:40:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 3172. [2019-11-15 23:40:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3172 states. [2019-11-15 23:40:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 5009 transitions. [2019-11-15 23:40:19,427 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 5009 transitions. Word has length 218 [2019-11-15 23:40:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:19,427 INFO L462 AbstractCegarLoop]: Abstraction has 3172 states and 5009 transitions. [2019-11-15 23:40:19,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 5009 transitions. [2019-11-15 23:40:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-15 23:40:19,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:19,435 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 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] [2019-11-15 23:40:19,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:19,648 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1965066328, now seen corresponding path program 1 times [2019-11-15 23:40:19,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:19,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370309618] [2019-11-15 23:40:19,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:19,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 23:40:19,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370309618] [2019-11-15 23:40:19,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115961032] [2019-11-15 23:40:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:20,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:20,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:20,183 INFO L375 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 8 [2019-11-15 23:40:20,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:20,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:20,204 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:20,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:20,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:20,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:20,241 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:20,242 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:20,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:20,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:20,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 23:40:20,302 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:20,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 23:40:20,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860965132] [2019-11-15 23:40:20,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:20,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:20,304 INFO L87 Difference]: Start difference. First operand 3172 states and 5009 transitions. Second operand 9 states. [2019-11-15 23:40:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:21,828 INFO L93 Difference]: Finished difference Result 7576 states and 11886 transitions. [2019-11-15 23:40:21,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:40:21,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 222 [2019-11-15 23:40:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:21,833 INFO L225 Difference]: With dead ends: 7576 [2019-11-15 23:40:21,834 INFO L226 Difference]: Without dead ends: 4423 [2019-11-15 23:40:21,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:40:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2019-11-15 23:40:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 3473. [2019-11-15 23:40:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-11-15 23:40:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5471 transitions. [2019-11-15 23:40:21,932 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5471 transitions. Word has length 222 [2019-11-15 23:40:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:21,932 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 5471 transitions. [2019-11-15 23:40:21,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5471 transitions. [2019-11-15 23:40:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:40:21,942 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:21,942 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 23:40:22,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:22,149 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:22,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash 903548848, now seen corresponding path program 1 times [2019-11-15 23:40:22,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:22,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038138915] [2019-11-15 23:40:22,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:22,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038138915] [2019-11-15 23:40:22,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:22,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:22,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31072622] [2019-11-15 23:40:22,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:22,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:22,275 INFO L87 Difference]: Start difference. First operand 3473 states and 5471 transitions. Second operand 4 states. [2019-11-15 23:40:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:22,637 INFO L93 Difference]: Finished difference Result 7270 states and 11386 transitions. [2019-11-15 23:40:22,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:22,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-15 23:40:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:22,642 INFO L225 Difference]: With dead ends: 7270 [2019-11-15 23:40:22,643 INFO L226 Difference]: Without dead ends: 3816 [2019-11-15 23:40:22,645 INFO L600 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 [2019-11-15 23:40:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2019-11-15 23:40:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3494. [2019-11-15 23:40:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2019-11-15 23:40:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5499 transitions. [2019-11-15 23:40:22,701 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5499 transitions. Word has length 229 [2019-11-15 23:40:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:22,701 INFO L462 AbstractCegarLoop]: Abstraction has 3494 states and 5499 transitions. [2019-11-15 23:40:22,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5499 transitions. [2019-11-15 23:40:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:40:22,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:22,704 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 23:40:22,705 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1582821102, now seen corresponding path program 1 times [2019-11-15 23:40:22,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:22,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43937387] [2019-11-15 23:40:22,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:22,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:22,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43937387] [2019-11-15 23:40:22,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:22,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:22,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355722595] [2019-11-15 23:40:22,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:22,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:22,833 INFO L87 Difference]: Start difference. First operand 3494 states and 5499 transitions. Second operand 4 states. [2019-11-15 23:40:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:23,311 INFO L93 Difference]: Finished difference Result 7270 states and 11386 transitions. [2019-11-15 23:40:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:23,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-15 23:40:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:23,314 INFO L225 Difference]: With dead ends: 7270 [2019-11-15 23:40:23,314 INFO L226 Difference]: Without dead ends: 3795 [2019-11-15 23:40:23,316 INFO L600 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 [2019-11-15 23:40:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-11-15 23:40:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3473. [2019-11-15 23:40:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-11-15 23:40:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5464 transitions. [2019-11-15 23:40:23,375 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5464 transitions. Word has length 229 [2019-11-15 23:40:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 5464 transitions. [2019-11-15 23:40:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5464 transitions. [2019-11-15 23:40:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 23:40:23,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:23,379 INFO L380 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, 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] [2019-11-15 23:40:23,379 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash -46944584, now seen corresponding path program 1 times [2019-11-15 23:40:23,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:23,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189771563] [2019-11-15 23:40:23,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:23,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:23,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:23,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189771563] [2019-11-15 23:40:23,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:23,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:23,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302749456] [2019-11-15 23:40:23,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:23,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:23,497 INFO L87 Difference]: Start difference. First operand 3473 states and 5464 transitions. Second operand 4 states. [2019-11-15 23:40:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:24,148 INFO L93 Difference]: Finished difference Result 7151 states and 11181 transitions. [2019-11-15 23:40:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:24,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 23:40:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:24,152 INFO L225 Difference]: With dead ends: 7151 [2019-11-15 23:40:24,152 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 23:40:24,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 23:40:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3473. [2019-11-15 23:40:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-11-15 23:40:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5457 transitions. [2019-11-15 23:40:24,237 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5457 transitions. Word has length 230 [2019-11-15 23:40:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:24,237 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 5457 transitions. [2019-11-15 23:40:24,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5457 transitions. [2019-11-15 23:40:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 23:40:24,289 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:24,289 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:24,289 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1652611923, now seen corresponding path program 1 times [2019-11-15 23:40:24,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:24,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696852944] [2019-11-15 23:40:24,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:24,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:24,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:24,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696852944] [2019-11-15 23:40:24,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:24,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:24,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96248652] [2019-11-15 23:40:24,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:24,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:24,397 INFO L87 Difference]: Start difference. First operand 3473 states and 5457 transitions. Second operand 4 states. [2019-11-15 23:40:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:24,928 INFO L93 Difference]: Finished difference Result 7151 states and 11167 transitions. [2019-11-15 23:40:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:24,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 23:40:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:24,933 INFO L225 Difference]: With dead ends: 7151 [2019-11-15 23:40:24,933 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 23:40:24,935 INFO L600 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 [2019-11-15 23:40:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 23:40:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3473. [2019-11-15 23:40:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-11-15 23:40:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5450 transitions. [2019-11-15 23:40:25,022 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5450 transitions. Word has length 231 [2019-11-15 23:40:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:25,022 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 5450 transitions. [2019-11-15 23:40:25,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5450 transitions. [2019-11-15 23:40:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 23:40:25,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:25,027 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:25,027 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash -977058723, now seen corresponding path program 1 times [2019-11-15 23:40:25,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:25,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484242548] [2019-11-15 23:40:25,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:25,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484242548] [2019-11-15 23:40:25,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:25,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:25,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970048827] [2019-11-15 23:40:25,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:25,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:25,142 INFO L87 Difference]: Start difference. First operand 3473 states and 5450 transitions. Second operand 4 states. [2019-11-15 23:40:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:25,464 INFO L93 Difference]: Finished difference Result 7151 states and 11153 transitions. [2019-11-15 23:40:25,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:25,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 23:40:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:25,467 INFO L225 Difference]: With dead ends: 7151 [2019-11-15 23:40:25,467 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 23:40:25,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 23:40:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3473. [2019-11-15 23:40:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2019-11-15 23:40:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5443 transitions. [2019-11-15 23:40:25,531 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5443 transitions. Word has length 232 [2019-11-15 23:40:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 3473 states and 5443 transitions. [2019-11-15 23:40:25,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5443 transitions. [2019-11-15 23:40:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 23:40:25,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:25,534 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:40:25,535 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -303446366, now seen corresponding path program 1 times [2019-11-15 23:40:25,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:25,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022089868] [2019-11-15 23:40:25,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 23:40:25,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022089868] [2019-11-15 23:40:25,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:25,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:25,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139280723] [2019-11-15 23:40:25,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:25,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:25,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:25,641 INFO L87 Difference]: Start difference. First operand 3473 states and 5443 transitions. Second operand 4 states. [2019-11-15 23:40:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:25,957 INFO L93 Difference]: Finished difference Result 7186 states and 11245 transitions. [2019-11-15 23:40:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:25,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 23:40:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:25,960 INFO L225 Difference]: With dead ends: 7186 [2019-11-15 23:40:25,960 INFO L226 Difference]: Without dead ends: 3732 [2019-11-15 23:40:25,962 INFO L600 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 [2019-11-15 23:40:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3732 states. [2019-11-15 23:40:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3732 to 3620. [2019-11-15 23:40:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3620 states. [2019-11-15 23:40:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5688 transitions. [2019-11-15 23:40:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5688 transitions. Word has length 232 [2019-11-15 23:40:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:26,031 INFO L462 AbstractCegarLoop]: Abstraction has 3620 states and 5688 transitions. [2019-11-15 23:40:26,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5688 transitions. [2019-11-15 23:40:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 23:40:26,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:26,034 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:26,034 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:26,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1696854450, now seen corresponding path program 1 times [2019-11-15 23:40:26,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:26,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420154985] [2019-11-15 23:40:26,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:26,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:26,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:26,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420154985] [2019-11-15 23:40:26,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:26,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:26,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450292461] [2019-11-15 23:40:26,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:26,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:26,135 INFO L87 Difference]: Start difference. First operand 3620 states and 5688 transitions. Second operand 4 states. [2019-11-15 23:40:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:26,514 INFO L93 Difference]: Finished difference Result 7375 states and 11545 transitions. [2019-11-15 23:40:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:26,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 23:40:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:26,517 INFO L225 Difference]: With dead ends: 7375 [2019-11-15 23:40:26,517 INFO L226 Difference]: Without dead ends: 3774 [2019-11-15 23:40:26,519 INFO L600 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 [2019-11-15 23:40:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2019-11-15 23:40:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3620. [2019-11-15 23:40:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3620 states. [2019-11-15 23:40:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 5681 transitions. [2019-11-15 23:40:26,579 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 5681 transitions. Word has length 233 [2019-11-15 23:40:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:26,580 INFO L462 AbstractCegarLoop]: Abstraction has 3620 states and 5681 transitions. [2019-11-15 23:40:26,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 5681 transitions. [2019-11-15 23:40:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 23:40:26,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:26,582 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:40:26,583 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2126872611, now seen corresponding path program 1 times [2019-11-15 23:40:26,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:26,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831413406] [2019-11-15 23:40:26,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:26,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:26,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 23:40:26,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831413406] [2019-11-15 23:40:26,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:26,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:26,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430743411] [2019-11-15 23:40:26,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:26,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:26,686 INFO L87 Difference]: Start difference. First operand 3620 states and 5681 transitions. Second operand 4 states. [2019-11-15 23:40:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:27,117 INFO L93 Difference]: Finished difference Result 7856 states and 12268 transitions. [2019-11-15 23:40:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:27,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 23:40:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:27,121 INFO L225 Difference]: With dead ends: 7856 [2019-11-15 23:40:27,121 INFO L226 Difference]: Without dead ends: 4255 [2019-11-15 23:40:27,126 INFO L600 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 [2019-11-15 23:40:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-11-15 23:40:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 3823. [2019-11-15 23:40:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3823 states. [2019-11-15 23:40:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6024 transitions. [2019-11-15 23:40:27,202 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6024 transitions. Word has length 233 [2019-11-15 23:40:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:27,202 INFO L462 AbstractCegarLoop]: Abstraction has 3823 states and 6024 transitions. [2019-11-15 23:40:27,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6024 transitions. [2019-11-15 23:40:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 23:40:27,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:27,205 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:27,205 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash 353219485, now seen corresponding path program 1 times [2019-11-15 23:40:27,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:27,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415910961] [2019-11-15 23:40:27,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-11-15 23:40:27,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415910961] [2019-11-15 23:40:27,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:27,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:27,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131414126] [2019-11-15 23:40:27,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:27,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:27,305 INFO L87 Difference]: Start difference. First operand 3823 states and 6024 transitions. Second operand 4 states. [2019-11-15 23:40:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:27,816 INFO L93 Difference]: Finished difference Result 8262 states and 12954 transitions. [2019-11-15 23:40:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:27,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 23:40:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:27,820 INFO L225 Difference]: With dead ends: 8262 [2019-11-15 23:40:27,820 INFO L226 Difference]: Without dead ends: 4458 [2019-11-15 23:40:27,822 INFO L600 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 [2019-11-15 23:40:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2019-11-15 23:40:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 3823. [2019-11-15 23:40:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3823 states. [2019-11-15 23:40:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6024 transitions. [2019-11-15 23:40:27,913 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6024 transitions. Word has length 233 [2019-11-15 23:40:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:27,913 INFO L462 AbstractCegarLoop]: Abstraction has 3823 states and 6024 transitions. [2019-11-15 23:40:27,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6024 transitions. [2019-11-15 23:40:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 23:40:27,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:27,918 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:27,918 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1541038206, now seen corresponding path program 1 times [2019-11-15 23:40:27,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:27,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588921782] [2019-11-15 23:40:27,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2019-11-15 23:40:28,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588921782] [2019-11-15 23:40:28,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:28,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:28,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872142532] [2019-11-15 23:40:28,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:28,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:28,030 INFO L87 Difference]: Start difference. First operand 3823 states and 6024 transitions. Second operand 4 states. [2019-11-15 23:40:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:28,539 INFO L93 Difference]: Finished difference Result 8038 states and 12576 transitions. [2019-11-15 23:40:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:28,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-11-15 23:40:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:28,544 INFO L225 Difference]: With dead ends: 8038 [2019-11-15 23:40:28,545 INFO L226 Difference]: Without dead ends: 4234 [2019-11-15 23:40:28,547 INFO L600 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 [2019-11-15 23:40:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-11-15 23:40:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3823. [2019-11-15 23:40:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3823 states. [2019-11-15 23:40:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3823 states and 6017 transitions. [2019-11-15 23:40:28,646 INFO L78 Accepts]: Start accepts. Automaton has 3823 states and 6017 transitions. Word has length 235 [2019-11-15 23:40:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:28,646 INFO L462 AbstractCegarLoop]: Abstraction has 3823 states and 6017 transitions. [2019-11-15 23:40:28,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3823 states and 6017 transitions. [2019-11-15 23:40:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-15 23:40:28,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:28,650 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-15 23:40:28,650 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2098969710, now seen corresponding path program 1 times [2019-11-15 23:40:28,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:28,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989827693] [2019-11-15 23:40:28,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:28,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:28,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-11-15 23:40:28,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989827693] [2019-11-15 23:40:28,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:28,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:28,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804401688] [2019-11-15 23:40:28,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:28,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:28,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:28,735 INFO L87 Difference]: Start difference. First operand 3823 states and 6017 transitions. Second operand 4 states. [2019-11-15 23:40:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:29,139 INFO L93 Difference]: Finished difference Result 8117 states and 12728 transitions. [2019-11-15 23:40:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:29,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-15 23:40:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:29,143 INFO L225 Difference]: With dead ends: 8117 [2019-11-15 23:40:29,143 INFO L226 Difference]: Without dead ends: 4313 [2019-11-15 23:40:29,145 INFO L600 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 [2019-11-15 23:40:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-11-15 23:40:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4068. [2019-11-15 23:40:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2019-11-15 23:40:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 6430 transitions. [2019-11-15 23:40:29,217 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 6430 transitions. Word has length 237 [2019-11-15 23:40:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:29,218 INFO L462 AbstractCegarLoop]: Abstraction has 4068 states and 6430 transitions. [2019-11-15 23:40:29,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 6430 transitions. [2019-11-15 23:40:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-15 23:40:29,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:29,221 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-15 23:40:29,221 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1350784978, now seen corresponding path program 1 times [2019-11-15 23:40:29,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:29,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884317892] [2019-11-15 23:40:29,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:29,222 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:29,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-11-15 23:40:29,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884317892] [2019-11-15 23:40:29,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:29,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:29,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829779604] [2019-11-15 23:40:29,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:29,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:29,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:29,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:29,322 INFO L87 Difference]: Start difference. First operand 4068 states and 6430 transitions. Second operand 4 states. [2019-11-15 23:40:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:29,720 INFO L93 Difference]: Finished difference Result 8432 states and 13253 transitions. [2019-11-15 23:40:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:29,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-15 23:40:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:29,724 INFO L225 Difference]: With dead ends: 8432 [2019-11-15 23:40:29,724 INFO L226 Difference]: Without dead ends: 4383 [2019-11-15 23:40:29,727 INFO L600 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 [2019-11-15 23:40:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-11-15 23:40:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4124. [2019-11-15 23:40:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2019-11-15 23:40:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 6528 transitions. [2019-11-15 23:40:29,839 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 6528 transitions. Word has length 237 [2019-11-15 23:40:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:29,839 INFO L462 AbstractCegarLoop]: Abstraction has 4124 states and 6528 transitions. [2019-11-15 23:40:29,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 6528 transitions. [2019-11-15 23:40:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-15 23:40:29,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:29,845 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-15 23:40:29,845 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1441915423, now seen corresponding path program 1 times [2019-11-15 23:40:29,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:29,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556996342] [2019-11-15 23:40:29,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:29,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:29,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 23:40:29,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556996342] [2019-11-15 23:40:29,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:29,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:29,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193235637] [2019-11-15 23:40:29,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:29,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:29,999 INFO L87 Difference]: Start difference. First operand 4124 states and 6528 transitions. Second operand 4 states. [2019-11-15 23:40:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:30,383 INFO L93 Difference]: Finished difference Result 8572 states and 13493 transitions. [2019-11-15 23:40:30,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:30,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-11-15 23:40:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:30,389 INFO L225 Difference]: With dead ends: 8572 [2019-11-15 23:40:30,389 INFO L226 Difference]: Without dead ends: 4467 [2019-11-15 23:40:30,392 INFO L600 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 [2019-11-15 23:40:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-11-15 23:40:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4215. [2019-11-15 23:40:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4215 states. [2019-11-15 23:40:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 6668 transitions. [2019-11-15 23:40:30,476 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 6668 transitions. Word has length 238 [2019-11-15 23:40:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:30,476 INFO L462 AbstractCegarLoop]: Abstraction has 4215 states and 6668 transitions. [2019-11-15 23:40:30,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 6668 transitions. [2019-11-15 23:40:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-15 23:40:30,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:30,480 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-15 23:40:30,480 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:30,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:30,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1965829027, now seen corresponding path program 1 times [2019-11-15 23:40:30,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:30,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007515420] [2019-11-15 23:40:30,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:30,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:30,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 284 proven. 96 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-15 23:40:30,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007515420] [2019-11-15 23:40:30,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971743274] [2019-11-15 23:40:30,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:30,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:30,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:30,892 INFO L375 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 [2019-11-15 23:40:30,896 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:30,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:30,900 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:30,900 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:30,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:30,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:30,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:30,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:30,923 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:30,934 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:30,935 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:30,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,946 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:30,946 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:30,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:30,969 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:30,970 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:30,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:30,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:30,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 287 proven. 9 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-15 23:40:31,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:31,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:31,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185127051] [2019-11-15 23:40:31,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:31,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:31,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:31,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:31,037 INFO L87 Difference]: Start difference. First operand 4215 states and 6668 transitions. Second operand 9 states. [2019-11-15 23:40:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:31,995 INFO L93 Difference]: Finished difference Result 9148 states and 14320 transitions. [2019-11-15 23:40:31,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:31,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 238 [2019-11-15 23:40:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:31,999 INFO L225 Difference]: With dead ends: 9148 [2019-11-15 23:40:32,000 INFO L226 Difference]: Without dead ends: 4952 [2019-11-15 23:40:32,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states. [2019-11-15 23:40:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 4187. [2019-11-15 23:40:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-15 23:40:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 6633 transitions. [2019-11-15 23:40:32,116 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 6633 transitions. Word has length 238 [2019-11-15 23:40:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:32,116 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 6633 transitions. [2019-11-15 23:40:32,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 6633 transitions. [2019-11-15 23:40:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-15 23:40:32,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:32,119 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:32,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:32,321 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -950438059, now seen corresponding path program 1 times [2019-11-15 23:40:32,322 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:32,322 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264389565] [2019-11-15 23:40:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:32,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:32,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 225 proven. 44 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 23:40:32,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264389565] [2019-11-15 23:40:32,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175849478] [2019-11-15 23:40:32,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:32,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:32,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:32,677 INFO L375 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 8 [2019-11-15 23:40:32,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:32,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:32,696 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:32,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:32,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:32,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:32,726 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:32,727 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:32,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:32,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:32,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 225 proven. 44 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 23:40:32,786 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:32,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:40:32,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550866797] [2019-11-15 23:40:32,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:40:32,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:40:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:32,788 INFO L87 Difference]: Start difference. First operand 4187 states and 6633 transitions. Second operand 8 states. [2019-11-15 23:40:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:33,712 INFO L93 Difference]: Finished difference Result 8614 states and 13561 transitions. [2019-11-15 23:40:33,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:33,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 238 [2019-11-15 23:40:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:33,717 INFO L225 Difference]: With dead ends: 8614 [2019-11-15 23:40:33,717 INFO L226 Difference]: Without dead ends: 4446 [2019-11-15 23:40:33,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:40:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-11-15 23:40:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 4187. [2019-11-15 23:40:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4187 states. [2019-11-15 23:40:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 6570 transitions. [2019-11-15 23:40:33,803 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 6570 transitions. Word has length 238 [2019-11-15 23:40:33,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:33,803 INFO L462 AbstractCegarLoop]: Abstraction has 4187 states and 6570 transitions. [2019-11-15 23:40:33,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:40:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 6570 transitions. [2019-11-15 23:40:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 23:40:33,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:33,807 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-11-15 23:40:34,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:34,007 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 4859043, now seen corresponding path program 1 times [2019-11-15 23:40:34,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:34,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106006710] [2019-11-15 23:40:34,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:34,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:34,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 23:40:34,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106006710] [2019-11-15 23:40:34,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:34,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:34,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328598142] [2019-11-15 23:40:34,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:34,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:34,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:34,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:34,141 INFO L87 Difference]: Start difference. First operand 4187 states and 6570 transitions. Second operand 4 states. [2019-11-15 23:40:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:34,526 INFO L93 Difference]: Finished difference Result 8684 states and 13556 transitions. [2019-11-15 23:40:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:34,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-15 23:40:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:34,531 INFO L225 Difference]: With dead ends: 8684 [2019-11-15 23:40:34,531 INFO L226 Difference]: Without dead ends: 4516 [2019-11-15 23:40:34,534 INFO L600 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 [2019-11-15 23:40:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4516 states. [2019-11-15 23:40:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4516 to 4285. [2019-11-15 23:40:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2019-11-15 23:40:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6717 transitions. [2019-11-15 23:40:34,618 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6717 transitions. Word has length 239 [2019-11-15 23:40:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:34,618 INFO L462 AbstractCegarLoop]: Abstraction has 4285 states and 6717 transitions. [2019-11-15 23:40:34,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6717 transitions. [2019-11-15 23:40:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 23:40:34,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:34,621 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-11-15 23:40:34,622 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1738963493, now seen corresponding path program 1 times [2019-11-15 23:40:34,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:34,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735023903] [2019-11-15 23:40:34,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:34,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:34,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 287 proven. 99 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 23:40:34,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735023903] [2019-11-15 23:40:34,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993715688] [2019-11-15 23:40:34,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:34,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:34,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:35,012 INFO L375 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 [2019-11-15 23:40:35,016 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:35,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:35,022 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:35,022 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:35,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:35,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:35,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:35,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:35,043 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:35,061 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:35,061 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:35,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,072 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:35,072 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:35,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:35,094 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:35,094 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:35,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:35,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:35,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 291 proven. 7 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-15 23:40:35,143 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:35,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:35,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769857673] [2019-11-15 23:40:35,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:35,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:35,144 INFO L87 Difference]: Start difference. First operand 4285 states and 6717 transitions. Second operand 9 states. [2019-11-15 23:40:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:36,090 INFO L93 Difference]: Finished difference Result 9211 states and 14278 transitions. [2019-11-15 23:40:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 239 [2019-11-15 23:40:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:36,094 INFO L225 Difference]: With dead ends: 9211 [2019-11-15 23:40:36,094 INFO L226 Difference]: Without dead ends: 4945 [2019-11-15 23:40:36,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2019-11-15 23:40:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4194. [2019-11-15 23:40:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-15 23:40:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6563 transitions. [2019-11-15 23:40:36,178 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6563 transitions. Word has length 239 [2019-11-15 23:40:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:36,178 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6563 transitions. [2019-11-15 23:40:36,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6563 transitions. [2019-11-15 23:40:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 23:40:36,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:36,181 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:36,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:36,382 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 403861424, now seen corresponding path program 1 times [2019-11-15 23:40:36,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:36,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996262035] [2019-11-15 23:40:36,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:36,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:36,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 230 proven. 41 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-15 23:40:36,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996262035] [2019-11-15 23:40:36,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119077924] [2019-11-15 23:40:36,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:36,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:36,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:36,689 INFO L375 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 8 [2019-11-15 23:40:36,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:36,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:36,708 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:36,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:36,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:36,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:36,748 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:36,749 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:36,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:36,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:36,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 230 proven. 41 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-15 23:40:36,832 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:36,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:40:36,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066388628] [2019-11-15 23:40:36,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:40:36,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:40:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:36,834 INFO L87 Difference]: Start difference. First operand 4194 states and 6563 transitions. Second operand 8 states. [2019-11-15 23:40:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:37,827 INFO L93 Difference]: Finished difference Result 8628 states and 13421 transitions. [2019-11-15 23:40:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:37,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-11-15 23:40:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:37,830 INFO L225 Difference]: With dead ends: 8628 [2019-11-15 23:40:37,830 INFO L226 Difference]: Without dead ends: 4453 [2019-11-15 23:40:37,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:40:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2019-11-15 23:40:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4194. [2019-11-15 23:40:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-15 23:40:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6500 transitions. [2019-11-15 23:40:37,915 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6500 transitions. Word has length 239 [2019-11-15 23:40:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:37,915 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6500 transitions. [2019-11-15 23:40:37,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:40:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6500 transitions. [2019-11-15 23:40:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 23:40:37,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:37,918 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:38,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:38,119 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1650894406, now seen corresponding path program 1 times [2019-11-15 23:40:38,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:38,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718363139] [2019-11-15 23:40:38,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:38,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:38,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 235 proven. 38 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 23:40:38,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718363139] [2019-11-15 23:40:38,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513440826] [2019-11-15 23:40:38,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:38,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:38,474 INFO L375 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 8 [2019-11-15 23:40:38,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:38,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:38,492 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:38,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:38,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:38,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:38,525 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:38,526 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:38,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:38,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:38,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 235 proven. 38 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 23:40:38,584 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:38,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:40:38,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62607086] [2019-11-15 23:40:38,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:40:38,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:40:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:38,585 INFO L87 Difference]: Start difference. First operand 4194 states and 6500 transitions. Second operand 8 states. [2019-11-15 23:40:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:39,349 INFO L93 Difference]: Finished difference Result 8628 states and 13295 transitions. [2019-11-15 23:40:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:39,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-11-15 23:40:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:39,353 INFO L225 Difference]: With dead ends: 8628 [2019-11-15 23:40:39,353 INFO L226 Difference]: Without dead ends: 4453 [2019-11-15 23:40:39,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:40:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2019-11-15 23:40:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4194. [2019-11-15 23:40:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-15 23:40:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6437 transitions. [2019-11-15 23:40:39,446 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6437 transitions. Word has length 240 [2019-11-15 23:40:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:39,447 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6437 transitions. [2019-11-15 23:40:39,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:40:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6437 transitions. [2019-11-15 23:40:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 23:40:39,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:39,451 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:39,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:39,652 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:39,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:39,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2012182539, now seen corresponding path program 1 times [2019-11-15 23:40:39,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:39,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130426339] [2019-11-15 23:40:39,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:39,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 240 proven. 35 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-15 23:40:39,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130426339] [2019-11-15 23:40:39,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434829368] [2019-11-15 23:40:39,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:39,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:39,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:39,955 INFO L375 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 8 [2019-11-15 23:40:39,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:39,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:39,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:39,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:39,969 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:39,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:39,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:39,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:39,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:39,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:39,995 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:39,995 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:39,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:40,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:40,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:40,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 240 proven. 35 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-15 23:40:40,060 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:40,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:40:40,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273386935] [2019-11-15 23:40:40,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:40:40,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:40:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:40,061 INFO L87 Difference]: Start difference. First operand 4194 states and 6437 transitions. Second operand 8 states. [2019-11-15 23:40:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:40,907 INFO L93 Difference]: Finished difference Result 8488 states and 13001 transitions. [2019-11-15 23:40:40,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:40,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-11-15 23:40:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:40,911 INFO L225 Difference]: With dead ends: 8488 [2019-11-15 23:40:40,911 INFO L226 Difference]: Without dead ends: 4313 [2019-11-15 23:40:40,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:40:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-11-15 23:40:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4194. [2019-11-15 23:40:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4194 states. [2019-11-15 23:40:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 6374 transitions. [2019-11-15 23:40:40,997 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 6374 transitions. Word has length 241 [2019-11-15 23:40:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:40,997 INFO L462 AbstractCegarLoop]: Abstraction has 4194 states and 6374 transitions. [2019-11-15 23:40:40,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:40:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 6374 transitions. [2019-11-15 23:40:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-15 23:40:41,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:41,000 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:41,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:41,201 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:41,201 INFO L82 PathProgramCache]: Analyzing trace with hash -958214637, now seen corresponding path program 1 times [2019-11-15 23:40:41,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:41,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941426598] [2019-11-15 23:40:41,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:41,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:41,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-11-15 23:40:41,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941426598] [2019-11-15 23:40:41,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:41,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:41,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123481587] [2019-11-15 23:40:41,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:41,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:41,292 INFO L87 Difference]: Start difference. First operand 4194 states and 6374 transitions. Second operand 4 states. [2019-11-15 23:40:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:41,747 INFO L93 Difference]: Finished difference Result 8920 states and 13514 transitions. [2019-11-15 23:40:41,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:41,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-15 23:40:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:41,750 INFO L225 Difference]: With dead ends: 8920 [2019-11-15 23:40:41,750 INFO L226 Difference]: Without dead ends: 4745 [2019-11-15 23:40:41,752 INFO L600 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 [2019-11-15 23:40:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2019-11-15 23:40:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4397. [2019-11-15 23:40:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-11-15 23:40:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6689 transitions. [2019-11-15 23:40:41,840 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6689 transitions. Word has length 242 [2019-11-15 23:40:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:41,840 INFO L462 AbstractCegarLoop]: Abstraction has 4397 states and 6689 transitions. [2019-11-15 23:40:41,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6689 transitions. [2019-11-15 23:40:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-15 23:40:41,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:41,843 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 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] [2019-11-15 23:40:41,843 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash 644351785, now seen corresponding path program 1 times [2019-11-15 23:40:41,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:41,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999453396] [2019-11-15 23:40:41,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:41,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:41,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:40:41,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999453396] [2019-11-15 23:40:41,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:41,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:41,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157912361] [2019-11-15 23:40:41,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:41,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:41,947 INFO L87 Difference]: Start difference. First operand 4397 states and 6689 transitions. Second operand 4 states. [2019-11-15 23:40:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:42,307 INFO L93 Difference]: Finished difference Result 8915 states and 13526 transitions. [2019-11-15 23:40:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:42,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-15 23:40:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:42,311 INFO L225 Difference]: With dead ends: 8915 [2019-11-15 23:40:42,311 INFO L226 Difference]: Without dead ends: 4537 [2019-11-15 23:40:42,313 INFO L600 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 [2019-11-15 23:40:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2019-11-15 23:40:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4397. [2019-11-15 23:40:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-11-15 23:40:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6682 transitions. [2019-11-15 23:40:42,400 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6682 transitions. Word has length 243 [2019-11-15 23:40:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:42,401 INFO L462 AbstractCegarLoop]: Abstraction has 4397 states and 6682 transitions. [2019-11-15 23:40:42,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6682 transitions. [2019-11-15 23:40:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-15 23:40:42,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:42,404 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:40:42,404 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash -78516302, now seen corresponding path program 1 times [2019-11-15 23:40:42,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:42,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710794874] [2019-11-15 23:40:42,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-15 23:40:42,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710794874] [2019-11-15 23:40:42,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:42,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:42,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564535070] [2019-11-15 23:40:42,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:42,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:42,491 INFO L87 Difference]: Start difference. First operand 4397 states and 6682 transitions. Second operand 4 states. [2019-11-15 23:40:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:42,875 INFO L93 Difference]: Finished difference Result 9090 states and 13759 transitions. [2019-11-15 23:40:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:42,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-15 23:40:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:42,879 INFO L225 Difference]: With dead ends: 9090 [2019-11-15 23:40:42,879 INFO L226 Difference]: Without dead ends: 4712 [2019-11-15 23:40:42,881 INFO L600 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 [2019-11-15 23:40:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2019-11-15 23:40:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4397. [2019-11-15 23:40:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-11-15 23:40:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6675 transitions. [2019-11-15 23:40:42,968 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6675 transitions. Word has length 243 [2019-11-15 23:40:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:42,968 INFO L462 AbstractCegarLoop]: Abstraction has 4397 states and 6675 transitions. [2019-11-15 23:40:42,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6675 transitions. [2019-11-15 23:40:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 23:40:42,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:42,971 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:42,972 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash 929304261, now seen corresponding path program 1 times [2019-11-15 23:40:42,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:42,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152924900] [2019-11-15 23:40:42,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:42,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:43,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152924900] [2019-11-15 23:40:43,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:43,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:43,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034485181] [2019-11-15 23:40:43,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:43,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:43,076 INFO L87 Difference]: Start difference. First operand 4397 states and 6675 transitions. Second operand 4 states. [2019-11-15 23:40:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:43,461 INFO L93 Difference]: Finished difference Result 9090 states and 13745 transitions. [2019-11-15 23:40:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:43,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-15 23:40:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:43,465 INFO L225 Difference]: With dead ends: 9090 [2019-11-15 23:40:43,465 INFO L226 Difference]: Without dead ends: 4712 [2019-11-15 23:40:43,467 INFO L600 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 [2019-11-15 23:40:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2019-11-15 23:40:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4530. [2019-11-15 23:40:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4530 states. [2019-11-15 23:40:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 6871 transitions. [2019-11-15 23:40:43,555 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 6871 transitions. Word has length 244 [2019-11-15 23:40:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:43,555 INFO L462 AbstractCegarLoop]: Abstraction has 4530 states and 6871 transitions. [2019-11-15 23:40:43,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 6871 transitions. [2019-11-15 23:40:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 23:40:43,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:43,558 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:43,559 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 956369863, now seen corresponding path program 1 times [2019-11-15 23:40:43,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:43,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040830648] [2019-11-15 23:40:43,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:43,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:43,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:43,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040830648] [2019-11-15 23:40:43,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:43,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:43,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279236352] [2019-11-15 23:40:43,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:43,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:43,676 INFO L87 Difference]: Start difference. First operand 4530 states and 6871 transitions. Second operand 4 states. [2019-11-15 23:40:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:44,042 INFO L93 Difference]: Finished difference Result 9195 states and 13911 transitions. [2019-11-15 23:40:44,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:44,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-15 23:40:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:44,046 INFO L225 Difference]: With dead ends: 9195 [2019-11-15 23:40:44,046 INFO L226 Difference]: Without dead ends: 4684 [2019-11-15 23:40:44,048 INFO L600 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 [2019-11-15 23:40:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-11-15 23:40:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4537. [2019-11-15 23:40:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-11-15 23:40:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6878 transitions. [2019-11-15 23:40:44,137 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6878 transitions. Word has length 244 [2019-11-15 23:40:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:44,137 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 6878 transitions. [2019-11-15 23:40:44,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6878 transitions. [2019-11-15 23:40:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 23:40:44,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:44,141 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:44,141 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1504182877, now seen corresponding path program 1 times [2019-11-15 23:40:44,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:44,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685589903] [2019-11-15 23:40:44,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:40:44,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685589903] [2019-11-15 23:40:44,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:44,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:44,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833247353] [2019-11-15 23:40:44,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:44,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:44,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:44,304 INFO L87 Difference]: Start difference. First operand 4537 states and 6878 transitions. Second operand 4 states. [2019-11-15 23:40:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:44,715 INFO L93 Difference]: Finished difference Result 9216 states and 13925 transitions. [2019-11-15 23:40:44,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:44,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-11-15 23:40:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:44,719 INFO L225 Difference]: With dead ends: 9216 [2019-11-15 23:40:44,719 INFO L226 Difference]: Without dead ends: 4684 [2019-11-15 23:40:44,721 INFO L600 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 [2019-11-15 23:40:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-11-15 23:40:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4530. [2019-11-15 23:40:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4530 states. [2019-11-15 23:40:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4530 states to 4530 states and 6864 transitions. [2019-11-15 23:40:44,810 INFO L78 Accepts]: Start accepts. Automaton has 4530 states and 6864 transitions. Word has length 245 [2019-11-15 23:40:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:44,811 INFO L462 AbstractCegarLoop]: Abstraction has 4530 states and 6864 transitions. [2019-11-15 23:40:44,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4530 states and 6864 transitions. [2019-11-15 23:40:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-15 23:40:44,813 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:44,814 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-11-15 23:40:44,814 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1260286246, now seen corresponding path program 1 times [2019-11-15 23:40:44,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:44,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535671976] [2019-11-15 23:40:44,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:44,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-15 23:40:44,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535671976] [2019-11-15 23:40:44,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203163125] [2019-11-15 23:40:44,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:45,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:40:45,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:45,153 INFO L375 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 8 [2019-11-15 23:40:45,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:45,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:40:45,168 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:45,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:40:45,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:45,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:40:45,194 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:45,194 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:45,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:45,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:45,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-11-15 23:40:45,261 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:45,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:40:45,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259203315] [2019-11-15 23:40:45,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:40:45,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:40:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:40:45,262 INFO L87 Difference]: Start difference. First operand 4530 states and 6864 transitions. Second operand 8 states. [2019-11-15 23:40:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:46,216 INFO L93 Difference]: Finished difference Result 9767 states and 14697 transitions. [2019-11-15 23:40:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:40:46,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2019-11-15 23:40:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:46,220 INFO L225 Difference]: With dead ends: 9767 [2019-11-15 23:40:46,220 INFO L226 Difference]: Without dead ends: 5256 [2019-11-15 23:40:46,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:40:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2019-11-15 23:40:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 4544. [2019-11-15 23:40:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6885 transitions. [2019-11-15 23:40:46,316 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6885 transitions. Word has length 246 [2019-11-15 23:40:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:46,316 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6885 transitions. [2019-11-15 23:40:46,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:40:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6885 transitions. [2019-11-15 23:40:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-15 23:40:46,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:46,319 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:46,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:46,520 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -656837738, now seen corresponding path program 1 times [2019-11-15 23:40:46,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:46,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811306107] [2019-11-15 23:40:46,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:46,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 23:40:46,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811306107] [2019-11-15 23:40:46,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:46,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:46,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888790405] [2019-11-15 23:40:46,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:46,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:46,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:46,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:46,637 INFO L87 Difference]: Start difference. First operand 4544 states and 6885 transitions. Second operand 4 states. [2019-11-15 23:40:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:47,020 INFO L93 Difference]: Finished difference Result 9223 states and 13932 transitions. [2019-11-15 23:40:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:47,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-11-15 23:40:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:47,024 INFO L225 Difference]: With dead ends: 9223 [2019-11-15 23:40:47,024 INFO L226 Difference]: Without dead ends: 4698 [2019-11-15 23:40:47,026 INFO L600 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 [2019-11-15 23:40:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2019-11-15 23:40:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4544. [2019-11-15 23:40:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6878 transitions. [2019-11-15 23:40:47,115 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6878 transitions. Word has length 260 [2019-11-15 23:40:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:47,116 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6878 transitions. [2019-11-15 23:40:47,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6878 transitions. [2019-11-15 23:40:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-11-15 23:40:47,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:47,119 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:47,119 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1713568940, now seen corresponding path program 1 times [2019-11-15 23:40:47,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:47,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870429340] [2019-11-15 23:40:47,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:47,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 397 proven. 75 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-15 23:40:47,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870429340] [2019-11-15 23:40:47,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242362311] [2019-11-15 23:40:47,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:47,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:47,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:47,577 INFO L375 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 [2019-11-15 23:40:47,585 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:47,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:47,590 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:47,591 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:47,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:47,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:47,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:47,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:47,617 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:47,629 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:47,630 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:47,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,644 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:47,644 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:47,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:47,680 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:47,681 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:47,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:47,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:47,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 393 proven. 23 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-11-15 23:40:47,743 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:47,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:47,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983306255] [2019-11-15 23:40:47,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:47,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:47,744 INFO L87 Difference]: Start difference. First operand 4544 states and 6878 transitions. Second operand 9 states. [2019-11-15 23:40:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:48,679 INFO L93 Difference]: Finished difference Result 9512 states and 14325 transitions. [2019-11-15 23:40:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:48,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 260 [2019-11-15 23:40:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:48,683 INFO L225 Difference]: With dead ends: 9512 [2019-11-15 23:40:48,683 INFO L226 Difference]: Without dead ends: 4987 [2019-11-15 23:40:48,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2019-11-15 23:40:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4544. [2019-11-15 23:40:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6822 transitions. [2019-11-15 23:40:48,779 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6822 transitions. Word has length 260 [2019-11-15 23:40:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:48,780 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6822 transitions. [2019-11-15 23:40:48,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6822 transitions. [2019-11-15 23:40:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-15 23:40:48,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:48,783 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:48,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:48,984 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:48,984 INFO L82 PathProgramCache]: Analyzing trace with hash -614175819, now seen corresponding path program 1 times [2019-11-15 23:40:48,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:48,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391520037] [2019-11-15 23:40:48,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:48,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:48,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-11-15 23:40:49,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391520037] [2019-11-15 23:40:49,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:49,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:49,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343198140] [2019-11-15 23:40:49,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:49,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:49,112 INFO L87 Difference]: Start difference. First operand 4544 states and 6822 transitions. Second operand 4 states. [2019-11-15 23:40:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:49,626 INFO L93 Difference]: Finished difference Result 9209 states and 13792 transitions. [2019-11-15 23:40:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:49,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-11-15 23:40:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:49,630 INFO L225 Difference]: With dead ends: 9209 [2019-11-15 23:40:49,630 INFO L226 Difference]: Without dead ends: 4684 [2019-11-15 23:40:49,632 INFO L600 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 [2019-11-15 23:40:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-11-15 23:40:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4544. [2019-11-15 23:40:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6815 transitions. [2019-11-15 23:40:49,723 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6815 transitions. Word has length 261 [2019-11-15 23:40:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:49,724 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6815 transitions. [2019-11-15 23:40:49,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6815 transitions. [2019-11-15 23:40:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-15 23:40:49,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:49,727 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:49,727 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 986895287, now seen corresponding path program 1 times [2019-11-15 23:40:49,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:49,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604332550] [2019-11-15 23:40:49,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:49,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 401 proven. 78 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-15 23:40:49,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604332550] [2019-11-15 23:40:49,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807463913] [2019-11-15 23:40:49,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:50,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:50,066 INFO L375 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 [2019-11-15 23:40:50,070 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:50,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:50,076 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:50,076 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:50,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:50,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:50,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:50,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:50,111 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:50,122 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:50,122 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:50,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,132 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:50,133 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:50,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:50,151 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:50,151 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:50,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:50,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:50,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 398 proven. 21 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-11-15 23:40:50,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:50,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:50,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202545270] [2019-11-15 23:40:50,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:50,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:50,211 INFO L87 Difference]: Start difference. First operand 4544 states and 6815 transitions. Second operand 9 states. [2019-11-15 23:40:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:51,123 INFO L93 Difference]: Finished difference Result 9498 states and 14185 transitions. [2019-11-15 23:40:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:51,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2019-11-15 23:40:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:51,128 INFO L225 Difference]: With dead ends: 9498 [2019-11-15 23:40:51,128 INFO L226 Difference]: Without dead ends: 4973 [2019-11-15 23:40:51,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2019-11-15 23:40:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4544. [2019-11-15 23:40:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6759 transitions. [2019-11-15 23:40:51,226 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6759 transitions. Word has length 261 [2019-11-15 23:40:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:51,226 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6759 transitions. [2019-11-15 23:40:51,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6759 transitions. [2019-11-15 23:40:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 23:40:51,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:51,229 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:51,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:51,430 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1717422709, now seen corresponding path program 1 times [2019-11-15 23:40:51,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:51,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407487013] [2019-11-15 23:40:51,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:51,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:51,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-11-15 23:40:51,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407487013] [2019-11-15 23:40:51,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:51,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:51,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849408037] [2019-11-15 23:40:51,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:51,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:51,537 INFO L87 Difference]: Start difference. First operand 4544 states and 6759 transitions. Second operand 4 states. [2019-11-15 23:40:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:51,906 INFO L93 Difference]: Finished difference Result 9188 states and 13645 transitions. [2019-11-15 23:40:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:51,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-15 23:40:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:51,910 INFO L225 Difference]: With dead ends: 9188 [2019-11-15 23:40:51,910 INFO L226 Difference]: Without dead ends: 4663 [2019-11-15 23:40:51,912 INFO L600 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 [2019-11-15 23:40:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-11-15 23:40:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4544. [2019-11-15 23:40:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6752 transitions. [2019-11-15 23:40:52,012 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6752 transitions. Word has length 268 [2019-11-15 23:40:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:52,013 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6752 transitions. [2019-11-15 23:40:52,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6752 transitions. [2019-11-15 23:40:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-15 23:40:52,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:52,017 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:52,017 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 472010556, now seen corresponding path program 1 times [2019-11-15 23:40:52,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:52,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909294629] [2019-11-15 23:40:52,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:52,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:52,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-11-15 23:40:52,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909294629] [2019-11-15 23:40:52,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:52,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:52,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778570950] [2019-11-15 23:40:52,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:52,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:52,169 INFO L87 Difference]: Start difference. First operand 4544 states and 6752 transitions. Second operand 4 states. [2019-11-15 23:40:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:52,540 INFO L93 Difference]: Finished difference Result 9174 states and 13617 transitions. [2019-11-15 23:40:52,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:52,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2019-11-15 23:40:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:52,544 INFO L225 Difference]: With dead ends: 9174 [2019-11-15 23:40:52,544 INFO L226 Difference]: Without dead ends: 4649 [2019-11-15 23:40:52,546 INFO L600 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 [2019-11-15 23:40:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-11-15 23:40:52,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4544. [2019-11-15 23:40:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6745 transitions. [2019-11-15 23:40:52,640 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6745 transitions. Word has length 269 [2019-11-15 23:40:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:52,640 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6745 transitions. [2019-11-15 23:40:52,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6745 transitions. [2019-11-15 23:40:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-15 23:40:52,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:52,643 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:40:52,644 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash 514123781, now seen corresponding path program 1 times [2019-11-15 23:40:52,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:52,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423422189] [2019-11-15 23:40:52,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:52,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:52,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-15 23:40:52,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423422189] [2019-11-15 23:40:52,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:52,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:52,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759411618] [2019-11-15 23:40:52,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:52,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:52,757 INFO L87 Difference]: Start difference. First operand 4544 states and 6745 transitions. Second operand 4 states. [2019-11-15 23:40:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:53,127 INFO L93 Difference]: Finished difference Result 9209 states and 13638 transitions. [2019-11-15 23:40:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:53,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-15 23:40:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:53,131 INFO L225 Difference]: With dead ends: 9209 [2019-11-15 23:40:53,131 INFO L226 Difference]: Without dead ends: 4684 [2019-11-15 23:40:53,134 INFO L600 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 [2019-11-15 23:40:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-11-15 23:40:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4544. [2019-11-15 23:40:53,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6738 transitions. [2019-11-15 23:40:53,228 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6738 transitions. Word has length 270 [2019-11-15 23:40:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:53,228 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6738 transitions. [2019-11-15 23:40:53,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6738 transitions. [2019-11-15 23:40:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-15 23:40:53,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:53,232 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:40:53,232 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash -109157821, now seen corresponding path program 1 times [2019-11-15 23:40:53,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:53,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654111793] [2019-11-15 23:40:53,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:53,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:53,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 432 proven. 90 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 23:40:53,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654111793] [2019-11-15 23:40:53,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955996199] [2019-11-15 23:40:53,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:53,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:53,631 INFO L375 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 [2019-11-15 23:40:53,634 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:53,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:53,643 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:53,643 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:53,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:53,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:53,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:53,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:53,675 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:53,686 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:53,687 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:53,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,696 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:53,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:53,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:53,715 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:53,715 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:53,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:53,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:53,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 433 proven. 13 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-11-15 23:40:53,773 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:53,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:53,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116419969] [2019-11-15 23:40:53,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:53,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:53,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:53,774 INFO L87 Difference]: Start difference. First operand 4544 states and 6738 transitions. Second operand 9 states. [2019-11-15 23:40:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:54,643 INFO L93 Difference]: Finished difference Result 9561 states and 14108 transitions. [2019-11-15 23:40:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:54,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2019-11-15 23:40:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:54,647 INFO L225 Difference]: With dead ends: 9561 [2019-11-15 23:40:54,647 INFO L226 Difference]: Without dead ends: 5036 [2019-11-15 23:40:54,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 267 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-15 23:40:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4544. [2019-11-15 23:40:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6710 transitions. [2019-11-15 23:40:54,748 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6710 transitions. Word has length 270 [2019-11-15 23:40:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:54,748 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6710 transitions. [2019-11-15 23:40:54,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6710 transitions. [2019-11-15 23:40:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-15 23:40:54,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:54,751 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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] [2019-11-15 23:40:54,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:54,951 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:54,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2092844567, now seen corresponding path program 1 times [2019-11-15 23:40:54,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:54,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690855092] [2019-11-15 23:40:54,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:54,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:54,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-15 23:40:55,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690855092] [2019-11-15 23:40:55,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:55,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:55,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362468863] [2019-11-15 23:40:55,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:55,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:55,062 INFO L87 Difference]: Start difference. First operand 4544 states and 6710 transitions. Second operand 4 states. [2019-11-15 23:40:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:55,433 INFO L93 Difference]: Finished difference Result 9195 states and 13554 transitions. [2019-11-15 23:40:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:55,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2019-11-15 23:40:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:55,437 INFO L225 Difference]: With dead ends: 9195 [2019-11-15 23:40:55,437 INFO L226 Difference]: Without dead ends: 4670 [2019-11-15 23:40:55,439 INFO L600 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 [2019-11-15 23:40:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-11-15 23:40:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4544. [2019-11-15 23:40:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6703 transitions. [2019-11-15 23:40:55,536 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6703 transitions. Word has length 271 [2019-11-15 23:40:55,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:55,537 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6703 transitions. [2019-11-15 23:40:55,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6703 transitions. [2019-11-15 23:40:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-15 23:40:55,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:55,540 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 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] [2019-11-15 23:40:55,540 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash 60262251, now seen corresponding path program 1 times [2019-11-15 23:40:55,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:55,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91860018] [2019-11-15 23:40:55,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:55,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:55,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 436 proven. 93 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-15 23:40:55,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91860018] [2019-11-15 23:40:55,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247688621] [2019-11-15 23:40:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:55,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:40:55,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:40:55,955 INFO L375 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 [2019-11-15 23:40:55,958 INFO L375 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 24 treesize of output 16 [2019-11-15 23:40:55,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:40:55,963 INFO L567 ElimStorePlain]: treesize reduction 8, result has 33.3 percent of original size [2019-11-15 23:40:55,964 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:55,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:55,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:55,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:4 [2019-11-15 23:40:55,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:40:55,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:55,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:55,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:55,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:40:56,003 INFO L375 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 28 treesize of output 23 [2019-11-15 23:40:56,015 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:40:56,015 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:40:56,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:56,033 INFO L567 ElimStorePlain]: treesize reduction 8, result has 70.4 percent of original size [2019-11-15 23:40:56,033 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:56,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:56,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:56,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-11-15 23:40:56,052 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:40:56,052 INFO L375 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 28 treesize of output 10 [2019-11-15 23:40:56,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:40:56,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:40:56,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:40:56,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:40:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 438 proven. 11 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-15 23:40:56,113 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:40:56,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 23:40:56,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803616540] [2019-11-15 23:40:56,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:40:56,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:40:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:40:56,114 INFO L87 Difference]: Start difference. First operand 4544 states and 6703 transitions. Second operand 9 states. [2019-11-15 23:40:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:57,132 INFO L93 Difference]: Finished difference Result 9547 states and 14024 transitions. [2019-11-15 23:40:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:40:57,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 271 [2019-11-15 23:40:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:57,136 INFO L225 Difference]: With dead ends: 9547 [2019-11-15 23:40:57,136 INFO L226 Difference]: Without dead ends: 5022 [2019-11-15 23:40:57,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 268 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:40:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2019-11-15 23:40:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4544. [2019-11-15 23:40:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6675 transitions. [2019-11-15 23:40:57,239 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6675 transitions. Word has length 271 [2019-11-15 23:40:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:57,240 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6675 transitions. [2019-11-15 23:40:57,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:40:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6675 transitions. [2019-11-15 23:40:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-15 23:40:57,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:57,243 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:57,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:40:57,443 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash 619409766, now seen corresponding path program 1 times [2019-11-15 23:40:57,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:57,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829560585] [2019-11-15 23:40:57,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:57,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:57,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-15 23:40:57,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829560585] [2019-11-15 23:40:57,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:57,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:57,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687790658] [2019-11-15 23:40:57,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:57,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:57,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:57,526 INFO L87 Difference]: Start difference. First operand 4544 states and 6675 transitions. Second operand 4 states. [2019-11-15 23:40:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:57,841 INFO L93 Difference]: Finished difference Result 9111 states and 13373 transitions. [2019-11-15 23:40:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:57,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2019-11-15 23:40:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:57,845 INFO L225 Difference]: With dead ends: 9111 [2019-11-15 23:40:57,845 INFO L226 Difference]: Without dead ends: 4586 [2019-11-15 23:40:57,847 INFO L600 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 [2019-11-15 23:40:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2019-11-15 23:40:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4544. [2019-11-15 23:40:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6668 transitions. [2019-11-15 23:40:57,945 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6668 transitions. Word has length 277 [2019-11-15 23:40:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:57,945 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6668 transitions. [2019-11-15 23:40:57,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6668 transitions. [2019-11-15 23:40:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 23:40:57,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:57,948 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:57,949 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:57,949 INFO L82 PathProgramCache]: Analyzing trace with hash 793347691, now seen corresponding path program 1 times [2019-11-15 23:40:57,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:57,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229499090] [2019-11-15 23:40:57,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:57,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:57,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-15 23:40:58,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229499090] [2019-11-15 23:40:58,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:58,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:58,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905510600] [2019-11-15 23:40:58,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:58,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:58,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:58,030 INFO L87 Difference]: Start difference. First operand 4544 states and 6668 transitions. Second operand 4 states. [2019-11-15 23:40:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:58,338 INFO L93 Difference]: Finished difference Result 9097 states and 13345 transitions. [2019-11-15 23:40:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:58,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-11-15 23:40:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:58,341 INFO L225 Difference]: With dead ends: 9097 [2019-11-15 23:40:58,342 INFO L226 Difference]: Without dead ends: 4572 [2019-11-15 23:40:58,344 INFO L600 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 [2019-11-15 23:40:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4572 states. [2019-11-15 23:40:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4572 to 4544. [2019-11-15 23:40:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6661 transitions. [2019-11-15 23:40:58,443 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6661 transitions. Word has length 278 [2019-11-15 23:40:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:58,443 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6661 transitions. [2019-11-15 23:40:58,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6661 transitions. [2019-11-15 23:40:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 23:40:58,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:58,447 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:58,447 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash -440724513, now seen corresponding path program 1 times [2019-11-15 23:40:58,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:58,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513214247] [2019-11-15 23:40:58,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:58,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:58,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-15 23:40:58,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513214247] [2019-11-15 23:40:58,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:58,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:58,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200365797] [2019-11-15 23:40:58,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:58,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:58,524 INFO L87 Difference]: Start difference. First operand 4544 states and 6661 transitions. Second operand 4 states. [2019-11-15 23:40:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:58,909 INFO L93 Difference]: Finished difference Result 9230 states and 13498 transitions. [2019-11-15 23:40:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:58,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-11-15 23:40:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:58,913 INFO L225 Difference]: With dead ends: 9230 [2019-11-15 23:40:58,913 INFO L226 Difference]: Without dead ends: 4705 [2019-11-15 23:40:58,916 INFO L600 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 [2019-11-15 23:40:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2019-11-15 23:40:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 4544. [2019-11-15 23:40:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6654 transitions. [2019-11-15 23:40:59,022 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6654 transitions. Word has length 278 [2019-11-15 23:40:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:59,022 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6654 transitions. [2019-11-15 23:40:59,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6654 transitions. [2019-11-15 23:40:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 23:40:59,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:59,025 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:40:59,025 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 530243018, now seen corresponding path program 1 times [2019-11-15 23:40:59,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:59,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979334083] [2019-11-15 23:40:59,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:59,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:59,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-11-15 23:40:59,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979334083] [2019-11-15 23:40:59,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:59,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:59,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729113577] [2019-11-15 23:40:59,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:59,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:59,160 INFO L87 Difference]: Start difference. First operand 4544 states and 6654 transitions. Second operand 4 states. [2019-11-15 23:40:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:40:59,624 INFO L93 Difference]: Finished difference Result 9195 states and 13442 transitions. [2019-11-15 23:40:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:40:59,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-11-15 23:40:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:40:59,628 INFO L225 Difference]: With dead ends: 9195 [2019-11-15 23:40:59,628 INFO L226 Difference]: Without dead ends: 4670 [2019-11-15 23:40:59,630 INFO L600 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 [2019-11-15 23:40:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-11-15 23:40:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4544. [2019-11-15 23:40:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:40:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6647 transitions. [2019-11-15 23:40:59,729 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6647 transitions. Word has length 278 [2019-11-15 23:40:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:40:59,729 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6647 transitions. [2019-11-15 23:40:59,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:40:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6647 transitions. [2019-11-15 23:40:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-15 23:40:59,732 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:40:59,732 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:40:59,732 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:40:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:40:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2006043886, now seen corresponding path program 1 times [2019-11-15 23:40:59,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:40:59,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005891398] [2019-11-15 23:40:59,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:59,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:40:59,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:40:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:40:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-11-15 23:40:59,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005891398] [2019-11-15 23:40:59,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:40:59,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:40:59,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517912466] [2019-11-15 23:40:59,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:40:59,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:40:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:40:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:40:59,809 INFO L87 Difference]: Start difference. First operand 4544 states and 6647 transitions. Second operand 4 states. [2019-11-15 23:41:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:00,185 INFO L93 Difference]: Finished difference Result 9216 states and 13456 transitions. [2019-11-15 23:41:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:00,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2019-11-15 23:41:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:00,189 INFO L225 Difference]: With dead ends: 9216 [2019-11-15 23:41:00,189 INFO L226 Difference]: Without dead ends: 4691 [2019-11-15 23:41:00,191 INFO L600 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 [2019-11-15 23:41:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2019-11-15 23:41:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4544. [2019-11-15 23:41:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:41:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6640 transitions. [2019-11-15 23:41:00,292 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6640 transitions. Word has length 279 [2019-11-15 23:41:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:00,292 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6640 transitions. [2019-11-15 23:41:00,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6640 transitions. [2019-11-15 23:41:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-15 23:41:00,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:00,295 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:00,295 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:00,296 INFO L82 PathProgramCache]: Analyzing trace with hash 655707163, now seen corresponding path program 1 times [2019-11-15 23:41:00,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:00,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000061018] [2019-11-15 23:41:00,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:00,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:00,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-11-15 23:41:00,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000061018] [2019-11-15 23:41:00,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:00,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:00,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893715254] [2019-11-15 23:41:00,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:00,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:00,387 INFO L87 Difference]: Start difference. First operand 4544 states and 6640 transitions. Second operand 4 states. [2019-11-15 23:41:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:00,748 INFO L93 Difference]: Finished difference Result 9160 states and 13369 transitions. [2019-11-15 23:41:00,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:00,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2019-11-15 23:41:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:00,752 INFO L225 Difference]: With dead ends: 9160 [2019-11-15 23:41:00,752 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 23:41:00,754 INFO L600 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 [2019-11-15 23:41:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 23:41:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4544. [2019-11-15 23:41:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:41:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6633 transitions. [2019-11-15 23:41:00,856 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6633 transitions. Word has length 279 [2019-11-15 23:41:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6633 transitions. [2019-11-15 23:41:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6633 transitions. [2019-11-15 23:41:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-15 23:41:00,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:00,860 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:00,860 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1223423783, now seen corresponding path program 1 times [2019-11-15 23:41:00,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:00,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570476426] [2019-11-15 23:41:00,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:00,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:00,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-11-15 23:41:00,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570476426] [2019-11-15 23:41:00,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:00,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:00,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732116323] [2019-11-15 23:41:00,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:00,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:00,962 INFO L87 Difference]: Start difference. First operand 4544 states and 6633 transitions. Second operand 4 states. [2019-11-15 23:41:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:01,313 INFO L93 Difference]: Finished difference Result 9153 states and 13348 transitions. [2019-11-15 23:41:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:01,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2019-11-15 23:41:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:01,316 INFO L225 Difference]: With dead ends: 9153 [2019-11-15 23:41:01,316 INFO L226 Difference]: Without dead ends: 4628 [2019-11-15 23:41:01,319 INFO L600 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 [2019-11-15 23:41:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2019-11-15 23:41:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 4544. [2019-11-15 23:41:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2019-11-15 23:41:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 6626 transitions. [2019-11-15 23:41:01,419 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 6626 transitions. Word has length 279 [2019-11-15 23:41:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:01,419 INFO L462 AbstractCegarLoop]: Abstraction has 4544 states and 6626 transitions. [2019-11-15 23:41:01,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 6626 transitions. [2019-11-15 23:41:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-11-15 23:41:01,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:01,422 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-15 23:41:01,422 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 258283927, now seen corresponding path program 1 times [2019-11-15 23:41:01,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:01,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451827928] [2019-11-15 23:41:01,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:01,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:01,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 424 proven. 51 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 23:41:01,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451827928] [2019-11-15 23:41:01,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710268442] [2019-11-15 23:41:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:01,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:41:01,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:01,744 INFO L375 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 8 [2019-11-15 23:41:01,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:01,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:41:01,765 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:41:01,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:41:01,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:01,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:41:01,788 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:41:01,789 INFO L375 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 28 treesize of output 10 [2019-11-15 23:41:01,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:01,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:01,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:41:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 424 proven. 51 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 23:41:01,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:01,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:41:01,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153876663] [2019-11-15 23:41:01,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:41:01,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:41:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:41:01,871 INFO L87 Difference]: Start difference. First operand 4544 states and 6626 transitions. Second operand 8 states. [2019-11-15 23:41:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:02,826 INFO L93 Difference]: Finished difference Result 9475 states and 13752 transitions. [2019-11-15 23:41:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:41:02,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 287 [2019-11-15 23:41:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:02,830 INFO L225 Difference]: With dead ends: 9475 [2019-11-15 23:41:02,830 INFO L226 Difference]: Without dead ends: 4950 [2019-11-15 23:41:02,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:41:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2019-11-15 23:41:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 4656. [2019-11-15 23:41:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2019-11-15 23:41:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 6724 transitions. [2019-11-15 23:41:02,986 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 6724 transitions. Word has length 287 [2019-11-15 23:41:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:02,986 INFO L462 AbstractCegarLoop]: Abstraction has 4656 states and 6724 transitions. [2019-11-15 23:41:02,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:41:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 6724 transitions. [2019-11-15 23:41:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-15 23:41:02,989 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:02,989 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-15 23:41:03,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:03,191 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1811618726, now seen corresponding path program 1 times [2019-11-15 23:41:03,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:03,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287459723] [2019-11-15 23:41:03,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:03,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:03,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 49 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-11-15 23:41:03,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287459723] [2019-11-15 23:41:03,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391825871] [2019-11-15 23:41:03,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:03,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:41:03,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:03,540 INFO L375 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 8 [2019-11-15 23:41:03,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:03,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:41:03,563 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:41:03,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:41:03,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:03,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 23:41:03,596 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:41:03,596 INFO L375 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 28 treesize of output 10 [2019-11-15 23:41:03,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:03,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:03,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 23:41:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 49 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-11-15 23:41:03,679 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:03,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 23:41:03,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721564709] [2019-11-15 23:41:03,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:41:03,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:03,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:41:03,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:41:03,680 INFO L87 Difference]: Start difference. First operand 4656 states and 6724 transitions. Second operand 8 states. [2019-11-15 23:41:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:04,767 INFO L93 Difference]: Finished difference Result 9573 states and 13780 transitions. [2019-11-15 23:41:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:41:04,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2019-11-15 23:41:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:04,771 INFO L225 Difference]: With dead ends: 9573 [2019-11-15 23:41:04,771 INFO L226 Difference]: Without dead ends: 4936 [2019-11-15 23:41:04,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:41:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4936 states. [2019-11-15 23:41:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4936 to 4656. [2019-11-15 23:41:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2019-11-15 23:41:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 6668 transitions. [2019-11-15 23:41:04,880 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 6668 transitions. Word has length 288 [2019-11-15 23:41:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:04,881 INFO L462 AbstractCegarLoop]: Abstraction has 4656 states and 6668 transitions. [2019-11-15 23:41:04,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:41:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 6668 transitions. [2019-11-15 23:41:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-15 23:41:04,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:04,884 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:05,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:05,084 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:05,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash -515450, now seen corresponding path program 1 times [2019-11-15 23:41:05,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:05,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91320740] [2019-11-15 23:41:05,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:05,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:05,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 23:41:05,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91320740] [2019-11-15 23:41:05,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:05,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:05,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385041195] [2019-11-15 23:41:05,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:05,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:05,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:05,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:05,187 INFO L87 Difference]: Start difference. First operand 4656 states and 6668 transitions. Second operand 4 states. [2019-11-15 23:41:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:05,564 INFO L93 Difference]: Finished difference Result 9384 states and 13425 transitions. [2019-11-15 23:41:05,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:05,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-11-15 23:41:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:05,568 INFO L225 Difference]: With dead ends: 9384 [2019-11-15 23:41:05,568 INFO L226 Difference]: Without dead ends: 4747 [2019-11-15 23:41:05,570 INFO L600 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 [2019-11-15 23:41:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2019-11-15 23:41:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 4656. [2019-11-15 23:41:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2019-11-15 23:41:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 6661 transitions. [2019-11-15 23:41:05,675 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 6661 transitions. Word has length 288 [2019-11-15 23:41:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:05,676 INFO L462 AbstractCegarLoop]: Abstraction has 4656 states and 6661 transitions. [2019-11-15 23:41:05,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 6661 transitions. [2019-11-15 23:41:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-11-15 23:41:05,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:05,679 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:05,679 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash 946522436, now seen corresponding path program 1 times [2019-11-15 23:41:05,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:05,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066371515] [2019-11-15 23:41:05,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:05,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:05,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-15 23:41:05,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066371515] [2019-11-15 23:41:05,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:05,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:41:05,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516759690] [2019-11-15 23:41:05,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:41:05,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:41:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:41:05,972 INFO L87 Difference]: Start difference. First operand 4656 states and 6661 transitions. Second operand 7 states. [2019-11-15 23:41:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:07,800 INFO L93 Difference]: Finished difference Result 13959 states and 19968 transitions. [2019-11-15 23:41:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:41:07,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 288 [2019-11-15 23:41:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:07,810 INFO L225 Difference]: With dead ends: 13959 [2019-11-15 23:41:07,810 INFO L226 Difference]: Without dead ends: 9322 [2019-11-15 23:41:07,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:41:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9322 states. [2019-11-15 23:41:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9322 to 8256. [2019-11-15 23:41:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8256 states. [2019-11-15 23:41:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8256 states to 8256 states and 11870 transitions. [2019-11-15 23:41:08,029 INFO L78 Accepts]: Start accepts. Automaton has 8256 states and 11870 transitions. Word has length 288 [2019-11-15 23:41:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:08,030 INFO L462 AbstractCegarLoop]: Abstraction has 8256 states and 11870 transitions. [2019-11-15 23:41:08,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:41:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8256 states and 11870 transitions. [2019-11-15 23:41:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-15 23:41:08,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:08,035 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:08,035 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:08,035 INFO L82 PathProgramCache]: Analyzing trace with hash -822270646, now seen corresponding path program 1 times [2019-11-15 23:41:08,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:08,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688039280] [2019-11-15 23:41:08,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:08,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:08,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-15 23:41:08,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688039280] [2019-11-15 23:41:08,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:08,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:08,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146811732] [2019-11-15 23:41:08,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:08,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:08,281 INFO L87 Difference]: Start difference. First operand 8256 states and 11870 transitions. Second operand 4 states. [2019-11-15 23:41:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:08,754 INFO L93 Difference]: Finished difference Result 16661 states and 23926 transitions. [2019-11-15 23:41:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:08,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2019-11-15 23:41:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:08,760 INFO L225 Difference]: With dead ends: 16661 [2019-11-15 23:41:08,760 INFO L226 Difference]: Without dead ends: 8368 [2019-11-15 23:41:08,764 INFO L600 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 [2019-11-15 23:41:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2019-11-15 23:41:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8200. [2019-11-15 23:41:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-11-15 23:41:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 11800 transitions. [2019-11-15 23:41:08,968 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 11800 transitions. Word has length 289 [2019-11-15 23:41:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:08,968 INFO L462 AbstractCegarLoop]: Abstraction has 8200 states and 11800 transitions. [2019-11-15 23:41:08,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 11800 transitions. [2019-11-15 23:41:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-15 23:41:08,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:08,973 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:08,973 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1231589155, now seen corresponding path program 1 times [2019-11-15 23:41:08,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:08,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555852071] [2019-11-15 23:41:08,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:08,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:08,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-11-15 23:41:09,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555852071] [2019-11-15 23:41:09,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:09,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:09,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350455963] [2019-11-15 23:41:09,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:09,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:09,094 INFO L87 Difference]: Start difference. First operand 8200 states and 11800 transitions. Second operand 4 states. [2019-11-15 23:41:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:09,634 INFO L93 Difference]: Finished difference Result 16647 states and 23904 transitions. [2019-11-15 23:41:09,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:09,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 289 [2019-11-15 23:41:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:09,641 INFO L225 Difference]: With dead ends: 16647 [2019-11-15 23:41:09,641 INFO L226 Difference]: Without dead ends: 8466 [2019-11-15 23:41:09,645 INFO L600 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 [2019-11-15 23:41:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8466 states. [2019-11-15 23:41:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8466 to 8200. [2019-11-15 23:41:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-11-15 23:41:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 11786 transitions. [2019-11-15 23:41:09,851 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 11786 transitions. Word has length 289 [2019-11-15 23:41:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:09,852 INFO L462 AbstractCegarLoop]: Abstraction has 8200 states and 11786 transitions. [2019-11-15 23:41:09,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 11786 transitions. [2019-11-15 23:41:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-15 23:41:09,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:09,857 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:09,857 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 843289703, now seen corresponding path program 1 times [2019-11-15 23:41:09,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:09,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572347631] [2019-11-15 23:41:09,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:09,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-11-15 23:41:09,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572347631] [2019-11-15 23:41:09,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:09,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:09,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514318394] [2019-11-15 23:41:09,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:09,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:09,988 INFO L87 Difference]: Start difference. First operand 8200 states and 11786 transitions. Second operand 4 states. [2019-11-15 23:41:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:10,668 INFO L93 Difference]: Finished difference Result 16633 states and 23869 transitions. [2019-11-15 23:41:10,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:10,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-11-15 23:41:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:10,675 INFO L225 Difference]: With dead ends: 16633 [2019-11-15 23:41:10,675 INFO L226 Difference]: Without dead ends: 8452 [2019-11-15 23:41:10,679 INFO L600 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 [2019-11-15 23:41:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8452 states. [2019-11-15 23:41:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8452 to 8200. [2019-11-15 23:41:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8200 states. [2019-11-15 23:41:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 11779 transitions. [2019-11-15 23:41:10,909 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 11779 transitions. Word has length 298 [2019-11-15 23:41:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:10,910 INFO L462 AbstractCegarLoop]: Abstraction has 8200 states and 11779 transitions. [2019-11-15 23:41:10,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 11779 transitions. [2019-11-15 23:41:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 23:41:10,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:10,915 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:10,915 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1395536868, now seen corresponding path program 1 times [2019-11-15 23:41:10,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:10,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684119923] [2019-11-15 23:41:10,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:10,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:10,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-15 23:41:11,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684119923] [2019-11-15 23:41:11,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:11,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:41:11,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378810560] [2019-11-15 23:41:11,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:41:11,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:41:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:41:11,069 INFO L87 Difference]: Start difference. First operand 8200 states and 11779 transitions. Second operand 5 states. [2019-11-15 23:41:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:12,069 INFO L93 Difference]: Finished difference Result 23417 states and 33662 transitions. [2019-11-15 23:41:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:41:12,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2019-11-15 23:41:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:12,081 INFO L225 Difference]: With dead ends: 23417 [2019-11-15 23:41:12,081 INFO L226 Difference]: Without dead ends: 15236 [2019-11-15 23:41:12,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:41:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15236 states. [2019-11-15 23:41:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15236 to 11575. [2019-11-15 23:41:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11575 states. [2019-11-15 23:41:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 16668 transitions. [2019-11-15 23:41:12,407 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 16668 transitions. Word has length 300 [2019-11-15 23:41:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:12,407 INFO L462 AbstractCegarLoop]: Abstraction has 11575 states and 16668 transitions. [2019-11-15 23:41:12,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:41:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 16668 transitions. [2019-11-15 23:41:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-15 23:41:12,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:12,413 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:12,413 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:12,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1513978342, now seen corresponding path program 1 times [2019-11-15 23:41:12,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:12,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270129395] [2019-11-15 23:41:12,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:12,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:12,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-15 23:41:12,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270129395] [2019-11-15 23:41:12,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:12,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:12,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480830658] [2019-11-15 23:41:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:12,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:12,528 INFO L87 Difference]: Start difference. First operand 11575 states and 16668 transitions. Second operand 4 states. [2019-11-15 23:41:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:13,114 INFO L93 Difference]: Finished difference Result 23369 states and 33605 transitions. [2019-11-15 23:41:13,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:13,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-11-15 23:41:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:13,123 INFO L225 Difference]: With dead ends: 23369 [2019-11-15 23:41:13,123 INFO L226 Difference]: Without dead ends: 11813 [2019-11-15 23:41:13,128 INFO L600 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 [2019-11-15 23:41:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11813 states. [2019-11-15 23:41:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11813 to 11575. [2019-11-15 23:41:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11575 states. [2019-11-15 23:41:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 16647 transitions. [2019-11-15 23:41:13,437 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 16647 transitions. Word has length 300 [2019-11-15 23:41:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:13,437 INFO L462 AbstractCegarLoop]: Abstraction has 11575 states and 16647 transitions. [2019-11-15 23:41:13,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 16647 transitions. [2019-11-15 23:41:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-15 23:41:13,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:13,443 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:13,443 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -741824237, now seen corresponding path program 1 times [2019-11-15 23:41:13,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:13,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194568574] [2019-11-15 23:41:13,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:13,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:13,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-15 23:41:13,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194568574] [2019-11-15 23:41:13,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:13,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:13,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555935260] [2019-11-15 23:41:13,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:13,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:13,573 INFO L87 Difference]: Start difference. First operand 11575 states and 16647 transitions. Second operand 4 states. [2019-11-15 23:41:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:14,138 INFO L93 Difference]: Finished difference Result 23285 states and 33456 transitions. [2019-11-15 23:41:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:14,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2019-11-15 23:41:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:14,147 INFO L225 Difference]: With dead ends: 23285 [2019-11-15 23:41:14,147 INFO L226 Difference]: Without dead ends: 11729 [2019-11-15 23:41:14,152 INFO L600 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 [2019-11-15 23:41:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2019-11-15 23:41:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 11575. [2019-11-15 23:41:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11575 states. [2019-11-15 23:41:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 16626 transitions. [2019-11-15 23:41:14,481 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 16626 transitions. Word has length 301 [2019-11-15 23:41:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:14,481 INFO L462 AbstractCegarLoop]: Abstraction has 11575 states and 16626 transitions. [2019-11-15 23:41:14,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 16626 transitions. [2019-11-15 23:41:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 23:41:14,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:14,487 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:41:14,487 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 17916459, now seen corresponding path program 1 times [2019-11-15 23:41:14,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:14,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525155160] [2019-11-15 23:41:14,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:14,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:14,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-11-15 23:41:14,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525155160] [2019-11-15 23:41:14,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:14,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:14,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835887915] [2019-11-15 23:41:14,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:14,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:14,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:14,591 INFO L87 Difference]: Start difference. First operand 11575 states and 16626 transitions. Second operand 4 states. [2019-11-15 23:41:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:15,264 INFO L93 Difference]: Finished difference Result 23383 states and 33535 transitions. [2019-11-15 23:41:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:15,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-15 23:41:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:15,276 INFO L225 Difference]: With dead ends: 23383 [2019-11-15 23:41:15,276 INFO L226 Difference]: Without dead ends: 11827 [2019-11-15 23:41:15,280 INFO L600 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 [2019-11-15 23:41:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11827 states. [2019-11-15 23:41:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11827 to 11575. [2019-11-15 23:41:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11575 states. [2019-11-15 23:41:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 16605 transitions. [2019-11-15 23:41:15,589 INFO L78 Accepts]: Start accepts. Automaton has 11575 states and 16605 transitions. Word has length 302 [2019-11-15 23:41:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:15,589 INFO L462 AbstractCegarLoop]: Abstraction has 11575 states and 16605 transitions. [2019-11-15 23:41:15,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 11575 states and 16605 transitions. [2019-11-15 23:41:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-15 23:41:15,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:15,595 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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] [2019-11-15 23:41:15,595 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 259877743, now seen corresponding path program 1 times [2019-11-15 23:41:15,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:15,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204561592] [2019-11-15 23:41:15,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:15,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:15,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-11-15 23:41:15,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204561592] [2019-11-15 23:41:15,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:15,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:15,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273033900] [2019-11-15 23:41:15,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:15,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:15,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:15,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:15,735 INFO L87 Difference]: Start difference. First operand 11575 states and 16605 transitions. Second operand 4 states. [2019-11-15 23:41:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:16,301 INFO L93 Difference]: Finished difference Result 23299 states and 33388 transitions. [2019-11-15 23:41:16,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:16,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-11-15 23:41:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:16,310 INFO L225 Difference]: With dead ends: 23299 [2019-11-15 23:41:16,310 INFO L226 Difference]: Without dead ends: 11512 [2019-11-15 23:41:16,316 INFO L600 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 [2019-11-15 23:41:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11512 states. [2019-11-15 23:41:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11512 to 11344. [2019-11-15 23:41:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11344 states. [2019-11-15 23:41:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11344 states to 11344 states and 16353 transitions. [2019-11-15 23:41:16,625 INFO L78 Accepts]: Start accepts. Automaton has 11344 states and 16353 transitions. Word has length 303 [2019-11-15 23:41:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:16,625 INFO L462 AbstractCegarLoop]: Abstraction has 11344 states and 16353 transitions. [2019-11-15 23:41:16,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11344 states and 16353 transitions. [2019-11-15 23:41:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 23:41:16,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:16,631 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 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] [2019-11-15 23:41:16,631 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash 646626542, now seen corresponding path program 1 times [2019-11-15 23:41:16,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:16,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073569582] [2019-11-15 23:41:16,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 23:41:16,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073569582] [2019-11-15 23:41:16,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:16,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:16,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564782371] [2019-11-15 23:41:16,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:16,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:16,727 INFO L87 Difference]: Start difference. First operand 11344 states and 16353 transitions. Second operand 4 states. [2019-11-15 23:41:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:17,275 INFO L93 Difference]: Finished difference Result 22837 states and 32884 transitions. [2019-11-15 23:41:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:17,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-11-15 23:41:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:17,284 INFO L225 Difference]: With dead ends: 22837 [2019-11-15 23:41:17,284 INFO L226 Difference]: Without dead ends: 11512 [2019-11-15 23:41:17,289 INFO L600 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 [2019-11-15 23:41:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11512 states. [2019-11-15 23:41:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11512 to 11344. [2019-11-15 23:41:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11344 states. [2019-11-15 23:41:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11344 states to 11344 states and 16332 transitions. [2019-11-15 23:41:17,597 INFO L78 Accepts]: Start accepts. Automaton has 11344 states and 16332 transitions. Word has length 310 [2019-11-15 23:41:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:17,597 INFO L462 AbstractCegarLoop]: Abstraction has 11344 states and 16332 transitions. [2019-11-15 23:41:17,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 11344 states and 16332 transitions. [2019-11-15 23:41:17,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 23:41:17,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:17,603 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:17,604 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:17,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1558831590, now seen corresponding path program 1 times [2019-11-15 23:41:17,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:17,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111020553] [2019-11-15 23:41:17,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:17,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:17,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-11-15 23:41:17,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111020553] [2019-11-15 23:41:17,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:17,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:17,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491899155] [2019-11-15 23:41:17,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:17,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:17,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:17,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:17,731 INFO L87 Difference]: Start difference. First operand 11344 states and 16332 transitions. Second operand 4 states. [2019-11-15 23:41:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:18,505 INFO L93 Difference]: Finished difference Result 23068 states and 33124 transitions. [2019-11-15 23:41:18,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:18,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-11-15 23:41:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:18,514 INFO L225 Difference]: With dead ends: 23068 [2019-11-15 23:41:18,514 INFO L226 Difference]: Without dead ends: 11743 [2019-11-15 23:41:18,519 INFO L600 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 [2019-11-15 23:41:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11743 states. [2019-11-15 23:41:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11743 to 11344. [2019-11-15 23:41:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11344 states. [2019-11-15 23:41:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11344 states to 11344 states and 16311 transitions. [2019-11-15 23:41:18,827 INFO L78 Accepts]: Start accepts. Automaton has 11344 states and 16311 transitions. Word has length 310 [2019-11-15 23:41:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:18,828 INFO L462 AbstractCegarLoop]: Abstraction has 11344 states and 16311 transitions. [2019-11-15 23:41:18,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 11344 states and 16311 transitions. [2019-11-15 23:41:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-15 23:41:18,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:18,836 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:18,836 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1922747955, now seen corresponding path program 1 times [2019-11-15 23:41:18,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:18,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118887858] [2019-11-15 23:41:18,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:18,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:18,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-15 23:41:18,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118887858] [2019-11-15 23:41:18,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:18,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:18,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562816325] [2019-11-15 23:41:18,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:18,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:18,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:18,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:18,936 INFO L87 Difference]: Start difference. First operand 11344 states and 16311 transitions. Second operand 4 states. [2019-11-15 23:41:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:19,448 INFO L93 Difference]: Finished difference Result 22753 states and 32693 transitions. [2019-11-15 23:41:19,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:19,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-15 23:41:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:19,457 INFO L225 Difference]: With dead ends: 22753 [2019-11-15 23:41:19,457 INFO L226 Difference]: Without dead ends: 11386 [2019-11-15 23:41:19,463 INFO L600 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 [2019-11-15 23:41:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11386 states. [2019-11-15 23:41:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11386 to 10861. [2019-11-15 23:41:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-15 23:41:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 15639 transitions. [2019-11-15 23:41:19,770 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 15639 transitions. Word has length 311 [2019-11-15 23:41:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:19,771 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 15639 transitions. [2019-11-15 23:41:19,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 15639 transitions. [2019-11-15 23:41:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-15 23:41:19,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:19,776 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 7, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:19,776 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1817785473, now seen corresponding path program 1 times [2019-11-15 23:41:19,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:19,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082789135] [2019-11-15 23:41:19,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:19,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:19,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-11-15 23:41:19,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082789135] [2019-11-15 23:41:19,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:19,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:41:19,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998073806] [2019-11-15 23:41:19,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:19,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:19,868 INFO L87 Difference]: Start difference. First operand 10861 states and 15639 transitions. Second operand 4 states. [2019-11-15 23:41:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:20,448 INFO L93 Difference]: Finished difference Result 21997 states and 31603 transitions. [2019-11-15 23:41:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:20,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-15 23:41:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:20,457 INFO L225 Difference]: With dead ends: 21997 [2019-11-15 23:41:20,457 INFO L226 Difference]: Without dead ends: 11155 [2019-11-15 23:41:20,463 INFO L600 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 [2019-11-15 23:41:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11155 states. [2019-11-15 23:41:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11155 to 10861. [2019-11-15 23:41:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-15 23:41:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 15618 transitions. [2019-11-15 23:41:20,776 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 15618 transitions. Word has length 311 [2019-11-15 23:41:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:20,776 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 15618 transitions. [2019-11-15 23:41:20,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 15618 transitions. [2019-11-15 23:41:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-15 23:41:20,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:20,781 INFO L380 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:20,781 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1403561262, now seen corresponding path program 1 times [2019-11-15 23:41:20,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:20,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301749982] [2019-11-15 23:41:20,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:20,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:20,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 192 proven. 33 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-15 23:41:20,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301749982] [2019-11-15 23:41:20,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16626016] [2019-11-15 23:41:20,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:21,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:41:21,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:21,225 INFO L375 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 8 [2019-11-15 23:41:21,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 23:41:21,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:41:21,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 23:41:21,247 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_200|]} [2019-11-15 23:41:21,249 INFO L375 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 31 treesize of output 19 [2019-11-15 23:41:21,249 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:21,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,256 INFO L375 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 13 [2019-11-15 23:41:21,257 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:21,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,276 INFO L375 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 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 23:41:21,276 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,295 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 23:41:21,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:21,298 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 23:41:21,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:21,339 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:41:21,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:21,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,364 INFO L375 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 23:41:21,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,413 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-11-15 23:41:21,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:41:21,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 23:41:21,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:21,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:21,468 INFO L375 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 28 treesize of output 10 [2019-11-15 23:41:21,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,473 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 23:41:21,474 INFO L375 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 28 treesize of output 10 [2019-11-15 23:41:21,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:21,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:21,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:41:21,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-15 23:41:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 193 proven. 13 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2019-11-15 23:41:21,755 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:41:21,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-11-15 23:41:21,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784607557] [2019-11-15 23:41:21,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:41:21,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:41:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:41:21,757 INFO L87 Difference]: Start difference. First operand 10861 states and 15618 transitions. Second operand 12 states. [2019-11-15 23:41:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:24,702 INFO L93 Difference]: Finished difference Result 24154 states and 34504 transitions. [2019-11-15 23:41:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:41:24,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 313 [2019-11-15 23:41:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:24,713 INFO L225 Difference]: With dead ends: 24154 [2019-11-15 23:41:24,713 INFO L226 Difference]: Without dead ends: 13312 [2019-11-15 23:41:24,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:41:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13312 states. [2019-11-15 23:41:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13312 to 10847. [2019-11-15 23:41:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10847 states. [2019-11-15 23:41:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10847 states to 10847 states and 15548 transitions. [2019-11-15 23:41:25,060 INFO L78 Accepts]: Start accepts. Automaton has 10847 states and 15548 transitions. Word has length 313 [2019-11-15 23:41:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:25,060 INFO L462 AbstractCegarLoop]: Abstraction has 10847 states and 15548 transitions. [2019-11-15 23:41:25,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:41:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10847 states and 15548 transitions. [2019-11-15 23:41:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-15 23:41:25,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:25,065 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:25,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:25,266 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -56016919, now seen corresponding path program 1 times [2019-11-15 23:41:25,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:25,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262961477] [2019-11-15 23:41:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:25,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 671 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-15 23:41:25,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262961477] [2019-11-15 23:41:25,480 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:25,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:41:25,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124623847] [2019-11-15 23:41:25,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:41:25,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:41:25,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:41:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:41:25,481 INFO L87 Difference]: Start difference. First operand 10847 states and 15548 transitions. Second operand 5 states. [2019-11-15 23:41:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:26,915 INFO L93 Difference]: Finished difference Result 27933 states and 40023 transitions. [2019-11-15 23:41:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:41:26,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 317 [2019-11-15 23:41:26,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:26,928 INFO L225 Difference]: With dead ends: 27933 [2019-11-15 23:41:26,929 INFO L226 Difference]: Without dead ends: 17105 [2019-11-15 23:41:26,935 INFO L600 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 [2019-11-15 23:41:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17105 states. [2019-11-15 23:41:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17105 to 13558. [2019-11-15 23:41:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13558 states. [2019-11-15 23:41:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13558 states to 13558 states and 19427 transitions. [2019-11-15 23:41:27,435 INFO L78 Accepts]: Start accepts. Automaton has 13558 states and 19427 transitions. Word has length 317 [2019-11-15 23:41:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:27,435 INFO L462 AbstractCegarLoop]: Abstraction has 13558 states and 19427 transitions. [2019-11-15 23:41:27,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:41:27,435 INFO L276 IsEmpty]: Start isEmpty. Operand 13558 states and 19427 transitions. [2019-11-15 23:41:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-15 23:41:27,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:27,441 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-15 23:41:27,441 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash 431056807, now seen corresponding path program 1 times [2019-11-15 23:41:27,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:41:27,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135554701] [2019-11-15 23:41:27,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:27,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:41:27,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:41:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 513 proven. 209 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-15 23:41:28,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135554701] [2019-11-15 23:41:28,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680256612] [2019-11-15 23:41:28,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:29,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 23:41:29,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:29,113 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_161|], 6=[|v_#memory_int_202|]} [2019-11-15 23:41:29,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,120 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 23:41:29,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,131 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 23:41:29,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,162 INFO L341 Elim1Store]: treesize reduction 70, result has 41.7 percent of original size [2019-11-15 23:41:29,163 INFO L375 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 2 case distinctions, treesize of input 41 treesize of output 62 [2019-11-15 23:41:29,163 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,173 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:74 [2019-11-15 23:41:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:29,825 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_162|], 12=[|v_#memory_int_203|]} [2019-11-15 23:41:29,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,839 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 87 [2019-11-15 23:41:29,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,847 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2019-11-15 23:41:29,847 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,895 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 66 [2019-11-15 23:41:29,895 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,901 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2019-11-15 23:41:29,901 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2019-11-15 23:41:29,948 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:29,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:29,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 89 [2019-11-15 23:41:29,966 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,985 INFO L567 ElimStorePlain]: treesize reduction 97, result has 29.2 percent of original size [2019-11-15 23:41:29,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:29,986 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:217, output treesize:40 [2019-11-15 23:41:30,017 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_163|, |v_#memory_$Pointer$.base_163|], 12=[|v_#memory_int_204|]} [2019-11-15 23:41:30,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,022 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:41:30,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:30,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:30,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,037 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-15 23:41:30,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:30,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:30,097 INFO L341 Elim1Store]: treesize reduction 120, result has 47.8 percent of original size [2019-11-15 23:41:30,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 128 [2019-11-15 23:41:30,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:30,126 INFO L567 ElimStorePlain]: treesize reduction 46, result has 61.3 percent of original size [2019-11-15 23:41:30,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:30,126 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:73 [2019-11-15 23:41:30,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,182 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.base_164|, |v_#memory_$Pointer$.offset_164|], 20=[|v_#memory_int_205|]} [2019-11-15 23:41:30,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,270 INFO L341 Elim1Store]: treesize reduction 64, result has 66.3 percent of original size [2019-11-15 23:41:30,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 250 [2019-11-15 23:41:30,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:30,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:30,414 INFO L341 Elim1Store]: treesize reduction 64, result has 72.6 percent of original size [2019-11-15 23:41:30,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 196 treesize of output 295 [2019-11-15 23:41:30,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:30,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:30,515 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:31,232 WARN L191 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 118 [2019-11-15 23:41:31,232 INFO L567 ElimStorePlain]: treesize reduction 2045, result has 26.9 percent of original size [2019-11-15 23:41:31,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:31,390 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-15 23:41:31,390 INFO L341 Elim1Store]: treesize reduction 52, result has 79.3 percent of original size [2019-11-15 23:41:31,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 386 treesize of output 434 [2019-11-15 23:41:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:31,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:31,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:32,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:33,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:33,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:34,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:34,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:41:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:41:36,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:36,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:36,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:36,151 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_70, v_arrayElimArr_2, v_prenex_58, v_prenex_13, v_prenex_44, v_prenex_66, v_prenex_4, v_prenex_29], 1=[v_prenex_71, v_prenex_75, v_arrayElimArr_1, v_prenex_30, v_prenex_69, v_prenex_14, v_prenex_24, v_prenex_67, v_prenex_5, v_prenex_59], 3=[v_prenex_61, v_prenex_60, v_prenex_43, v_prenex_42, v_prenex_20, v_prenex_64, v_prenex_41, v_prenex_63, v_prenex_62, v_prenex_47, v_prenex_25, v_prenex_46, v_prenex_68, v_prenex_45, v_prenex_22, v_prenex_28, v_prenex_27, v_prenex_48, v_prenex_26, v_prenex_19, v_prenex_2, v_prenex_3, v_prenex_6, v_prenex_7, v_prenex_72, v_prenex_8, v_prenex_50, v_prenex_9, v_prenex_32, v_prenex_76, v_prenex_10, v_prenex_54, v_prenex_31, v_prenex_74, v_prenex_52, v_prenex_36, v_prenex_35, v_prenex_57, v_prenex_34, v_prenex_12, v_prenex_56, v_prenex_18, v_prenex_39, v_prenex_17, v_prenex_38, v_prenex_16, v_prenex_37, v_prenex_15], 6=[v_prenex_21, v_prenex_65, v_prenex_53, v_prenex_40, v_prenex_73, v_prenex_51, v_prenex_23, v_prenex_33, v_prenex_77, v_prenex_11, v_prenex_55, v_prenex_49]} [2019-11-15 23:41:36,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:41:36,368 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no XNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-15 23:41:36,376 INFO L168 Benchmark]: Toolchain (without parser) took 114549.44 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 939.4 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,376 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:41:36,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.58 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,377 INFO L168 Benchmark]: Boogie Preprocessor took 74.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,377 INFO L168 Benchmark]: RCFGBuilder took 1294.22 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,378 INFO L168 Benchmark]: TraceAbstraction took 112323.69 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:41:36,379 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 764.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.58 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.37 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1294.22 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 112323.69 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no XNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no XNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:244) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:41:38,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:41:38,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:41:38,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:41:38,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:41:38,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:41:38,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:41:38,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:41:38,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:41:38,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:41:38,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:41:38,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:41:38,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:41:38,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:41:38,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:41:38,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:41:38,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:41:38,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:41:38,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:41:38,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:41:38,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:41:38,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:41:38,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:41:38,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:41:38,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:41:38,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:41:38,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:41:38,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:41:38,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:41:38,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:41:38,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:41:38,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:41:38,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:41:38,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:41:38,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:41:38,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:41:38,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:41:38,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:41:38,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:41:38,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:41:38,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:41:38,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:41:38,672 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:41:38,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:41:38,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:41:38,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:41:38,683 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:41:38,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:41:38,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:41:38,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:41:38,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:41:38,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:41:38,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:41:38,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:41:38,691 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:41:38,691 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:41:38,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:41:38,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:41:38,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:41:38,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:41:38,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:41:38,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:41:38,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:41:38,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:41:38,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:41:38,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:41:38,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:41:38,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:41:38,697 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:41:38,698 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:41:38,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:41:38,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:41:38,698 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff749335004059c19d9e9c2881f1952bea1250f3 [2019-11-15 23:41:38,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:41:38,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:41:38,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:41:38,745 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:41:38,746 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:41:38,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:41:38,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/13cb2e8ea/1c4d66619f9f480f94dae90c2360d64b/FLAGd14980b00 [2019-11-15 23:41:39,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:41:39,308 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/sv-benchmarks/c/ssh/s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:41:39,340 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/13cb2e8ea/1c4d66619f9f480f94dae90c2360d64b/FLAGd14980b00 [2019-11-15 23:41:39,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/data/13cb2e8ea/1c4d66619f9f480f94dae90c2360d64b [2019-11-15 23:41:39,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:41:39,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:41:39,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:41:39,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:41:39,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:41:39,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:41:39" (1/1) ... [2019-11-15 23:41:39,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fbc087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:39, skipping insertion in model container [2019-11-15 23:41:39,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:41:39" (1/1) ... [2019-11-15 23:41:39,564 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:41:39,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:41:40,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:41:40,167 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:41:40,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:41:40,334 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:41:40,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40 WrapperNode [2019-11-15 23:41:40,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:41:40,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:41:40,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:41:40,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:41:40,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:41:40,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:41:40,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:41:40,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:41:40,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... [2019-11-15 23:41:40,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:41:40,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:41:40,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:41:40,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:41:40,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/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 [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:41:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:41:40,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:41:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:41:40,876 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:41:43,148 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:41:43,148 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:41:43,149 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:41:43,150 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:41:43,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:41:43 BoogieIcfgContainer [2019-11-15 23:41:43,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:41:43,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:41:43,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:41:43,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:41:43,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:41:39" (1/3) ... [2019-11-15 23:41:43,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9f2354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:41:43, skipping insertion in model container [2019-11-15 23:41:43,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:41:40" (2/3) ... [2019-11-15 23:41:43,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9f2354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:41:43, skipping insertion in model container [2019-11-15 23:41:43,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:41:43" (3/3) ... [2019-11-15 23:41:43,158 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-2.c [2019-11-15 23:41:43,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:41:43,172 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:41:43,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:41:43,203 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:41:43,203 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:41:43,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:41:43,203 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:41:43,204 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:41:43,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:41:43,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:41:43,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:41:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:41:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:41:43,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:43,230 INFO L380 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] [2019-11-15 23:41:43,232 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 23:41:43,248 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:43,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [888760073] [2019-11-15 23:41:43,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:41:43,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:43,545 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:43,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [888760073] [2019-11-15 23:41:43,583 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:43,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:41:43,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505396610] [2019-11-15 23:41:43,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:43,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:43,602 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 23:41:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:43,777 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-15 23:41:43,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:43,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:41:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:43,794 INFO L225 Difference]: With dead ends: 564 [2019-11-15 23:41:43,795 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 23:41:43,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 23:41:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-15 23:41:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 23:41:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-15 23:41:43,893 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-15 23:41:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:43,894 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-15 23:41:43,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-15 23:41:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 23:41:43,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:43,903 INFO L380 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] [2019-11-15 23:41:44,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:44,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:44,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1192573563, now seen corresponding path program 1 times [2019-11-15 23:41:44,106 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:44,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [51183171] [2019-11-15 23:41:44,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:44,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:41:44,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:44,343 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:44,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51183171] [2019-11-15 23:41:44,364 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:44,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:41:44,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685765433] [2019-11-15 23:41:44,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:44,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:44,367 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-15 23:41:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:44,813 INFO L93 Difference]: Finished difference Result 882 states and 1356 transitions. [2019-11-15 23:41:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:44,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 23:41:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:44,818 INFO L225 Difference]: With dead ends: 882 [2019-11-15 23:41:44,819 INFO L226 Difference]: Without dead ends: 631 [2019-11-15 23:41:44,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-15 23:41:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-11-15 23:41:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-15 23:41:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 955 transitions. [2019-11-15 23:41:44,860 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 955 transitions. Word has length 59 [2019-11-15 23:41:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:44,862 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 955 transitions. [2019-11-15 23:41:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 955 transitions. [2019-11-15 23:41:44,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 23:41:44,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:44,874 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:45,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:45,076 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash 835701652, now seen corresponding path program 1 times [2019-11-15 23:41:45,077 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:45,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [19585654] [2019-11-15 23:41:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:45,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:41:45,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:41:45,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:41:45,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [19585654] [2019-11-15 23:41:45,439 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:45,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:41:45,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904414161] [2019-11-15 23:41:45,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:45,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:45,444 INFO L87 Difference]: Start difference. First operand 629 states and 955 transitions. Second operand 4 states. [2019-11-15 23:41:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:45,834 INFO L93 Difference]: Finished difference Result 1370 states and 2094 transitions. [2019-11-15 23:41:45,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:45,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 23:41:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:45,840 INFO L225 Difference]: With dead ends: 1370 [2019-11-15 23:41:45,840 INFO L226 Difference]: Without dead ends: 873 [2019-11-15 23:41:45,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-11-15 23:41:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2019-11-15 23:41:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-11-15 23:41:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1324 transitions. [2019-11-15 23:41:45,881 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1324 transitions. Word has length 115 [2019-11-15 23:41:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:45,882 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1324 transitions. [2019-11-15 23:41:45,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1324 transitions. [2019-11-15 23:41:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 23:41:45,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:45,886 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 23:41:46,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:46,096 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1727752296, now seen corresponding path program 1 times [2019-11-15 23:41:46,098 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:46,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [82919118] [2019-11-15 23:41:46,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:46,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:41:46,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:41:46,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:41:46,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [82919118] [2019-11-15 23:41:46,431 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:41:46,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:41:46,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488264610] [2019-11-15 23:41:46,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:46,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:46,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:46,433 INFO L87 Difference]: Start difference. First operand 873 states and 1324 transitions. Second operand 4 states. [2019-11-15 23:41:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:47,834 INFO L93 Difference]: Finished difference Result 1858 states and 2830 transitions. [2019-11-15 23:41:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:47,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-15 23:41:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:47,842 INFO L225 Difference]: With dead ends: 1858 [2019-11-15 23:41:47,842 INFO L226 Difference]: Without dead ends: 1117 [2019-11-15 23:41:47,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:41:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-11-15 23:41:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2019-11-15 23:41:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-11-15 23:41:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1690 transitions. [2019-11-15 23:41:47,899 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1690 transitions. Word has length 144 [2019-11-15 23:41:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:47,901 INFO L462 AbstractCegarLoop]: Abstraction has 1117 states and 1690 transitions. [2019-11-15 23:41:47,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1690 transitions. [2019-11-15 23:41:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 23:41:47,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:47,905 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:48,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:48,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1995830891, now seen corresponding path program 1 times [2019-11-15 23:41:48,117 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:48,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [395129894] [2019-11-15 23:41:48,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:50,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:41:50,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:50,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:41:50,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:50,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:41:50,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:50,551 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:41:50,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:50,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:41:50,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:50,612 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:41:50,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:50,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:50,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 23:41:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:41:50,689 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:41:50,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395129894] [2019-11-15 23:41:50,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:41:50,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:41:50,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215231869] [2019-11-15 23:41:50,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:50,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:41:50,802 INFO L87 Difference]: Start difference. First operand 1117 states and 1690 transitions. Second operand 4 states. [2019-11-15 23:41:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:41:56,222 INFO L93 Difference]: Finished difference Result 3268 states and 4967 transitions. [2019-11-15 23:41:56,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:41:56,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-15 23:41:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:41:56,237 INFO L225 Difference]: With dead ends: 3268 [2019-11-15 23:41:56,238 INFO L226 Difference]: Without dead ends: 2159 [2019-11-15 23:41:56,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:41:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2019-11-15 23:41:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 1369. [2019-11-15 23:41:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-11-15 23:41:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2140 transitions. [2019-11-15 23:41:56,301 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2140 transitions. Word has length 168 [2019-11-15 23:41:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:41:56,302 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 2140 transitions. [2019-11-15 23:41:56,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:41:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2140 transitions. [2019-11-15 23:41:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 23:41:56,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:41:56,307 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:41:56,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:56,517 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:41:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:41:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -165113856, now seen corresponding path program 1 times [2019-11-15 23:41:56,518 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:41:56,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [92281499] [2019-11-15 23:41:56,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:41:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:41:58,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:41:58,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:41:58,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:41:58,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:58,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:41:58,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:58,881 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:41:58,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:58,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:41:58,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:58,932 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:41:58,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:58,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:41:58,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 23:41:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 91 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:41:59,000 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:41:59,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [92281499] [2019-11-15 23:41:59,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:41:59,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:41:59,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339513053] [2019-11-15 23:41:59,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:41:59,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:41:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:41:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:41:59,074 INFO L87 Difference]: Start difference. First operand 1369 states and 2140 transitions. Second operand 4 states. [2019-11-15 23:42:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:03,273 INFO L93 Difference]: Finished difference Result 3772 states and 5867 transitions. [2019-11-15 23:42:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:03,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-11-15 23:42:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:03,287 INFO L225 Difference]: With dead ends: 3772 [2019-11-15 23:42:03,287 INFO L226 Difference]: Without dead ends: 2411 [2019-11-15 23:42:03,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:42:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-11-15 23:42:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1630. [2019-11-15 23:42:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-11-15 23:42:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2608 transitions. [2019-11-15 23:42:03,367 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2608 transitions. Word has length 169 [2019-11-15 23:42:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:03,368 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2608 transitions. [2019-11-15 23:42:03,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2608 transitions. [2019-11-15 23:42:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-15 23:42:03,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:03,373 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2019-11-15 23:42:03,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:03,582 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash 291966212, now seen corresponding path program 1 times [2019-11-15 23:42:03,583 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:03,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [750385013] [2019-11-15 23:42:03,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:06,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:42:06,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:06,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:42:06,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:06,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:42:06,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:42:06,430 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:42:06,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:06,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:42:06,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:06,467 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:42:06,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:06,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:06,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 23:42:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:42:06,569 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:42:06,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [750385013] [2019-11-15 23:42:06,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:42:06,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:42:06,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397819832] [2019-11-15 23:42:06,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:42:06,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:06,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:42:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:42:06,647 INFO L87 Difference]: Start difference. First operand 1630 states and 2608 transitions. Second operand 4 states. [2019-11-15 23:42:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:13,020 INFO L93 Difference]: Finished difference Result 4294 states and 6785 transitions. [2019-11-15 23:42:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:13,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-11-15 23:42:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:13,036 INFO L225 Difference]: With dead ends: 4294 [2019-11-15 23:42:13,036 INFO L226 Difference]: Without dead ends: 2672 [2019-11-15 23:42:13,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:42:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2019-11-15 23:42:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1864. [2019-11-15 23:42:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-11-15 23:42:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 3013 transitions. [2019-11-15 23:42:13,117 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 3013 transitions. Word has length 196 [2019-11-15 23:42:13,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:13,118 INFO L462 AbstractCegarLoop]: Abstraction has 1864 states and 3013 transitions. [2019-11-15 23:42:13,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3013 transitions. [2019-11-15 23:42:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 23:42:13,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:13,125 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:13,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:13,344 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash 868611193, now seen corresponding path program 1 times [2019-11-15 23:42:13,345 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:13,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1336809422] [2019-11-15 23:42:13,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:17,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:42:17,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:17,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:42:17,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:17,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:42:17,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:42:17,199 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:42:17,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:17,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:42:17,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:17,248 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:42:17,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:17,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:17,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-15 23:42:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 207 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:42:17,320 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:42:17,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1336809422] [2019-11-15 23:42:17,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:42:17,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-15 23:42:17,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543705691] [2019-11-15 23:42:17,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:42:17,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:42:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:42:17,410 INFO L87 Difference]: Start difference. First operand 1864 states and 3013 transitions. Second operand 4 states. [2019-11-15 23:42:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:23,469 INFO L93 Difference]: Finished difference Result 4501 states and 7136 transitions. [2019-11-15 23:42:23,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:23,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 23:42:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:23,492 INFO L225 Difference]: With dead ends: 4501 [2019-11-15 23:42:23,493 INFO L226 Difference]: Without dead ends: 2645 [2019-11-15 23:42:23,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:42:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-15 23:42:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1864. [2019-11-15 23:42:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2019-11-15 23:42:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2995 transitions. [2019-11-15 23:42:23,577 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2995 transitions. Word has length 197 [2019-11-15 23:42:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:23,578 INFO L462 AbstractCegarLoop]: Abstraction has 1864 states and 2995 transitions. [2019-11-15 23:42:23,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2995 transitions. [2019-11-15 23:42:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 23:42:23,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:23,584 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:23,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:23,793 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 145743106, now seen corresponding path program 1 times [2019-11-15 23:42:23,795 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:23,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1203541901] [2019-11-15 23:42:23,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:29,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:42:29,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:29,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:42:29,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 [2019-11-15 23:42:29,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:29,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:42:29,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:29,260 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:42:29,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:29,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:42:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:42:29,312 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:29,350 INFO L375 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 [2019-11-15 23:42:29,353 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:29,357 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:29,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:29,362 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:42:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:42:29,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1203541901] [2019-11-15 23:42:29,403 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:29,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:42:29,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766445965] [2019-11-15 23:42:29,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:42:29,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:42:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:42:29,406 INFO L87 Difference]: Start difference. First operand 1864 states and 2995 transitions. Second operand 7 states. [2019-11-15 23:42:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:39,458 INFO L93 Difference]: Finished difference Result 5347 states and 8343 transitions. [2019-11-15 23:42:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:42:39,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2019-11-15 23:42:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:39,477 INFO L225 Difference]: With dead ends: 5347 [2019-11-15 23:42:39,477 INFO L226 Difference]: Without dead ends: 3491 [2019-11-15 23:42:39,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:42:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2019-11-15 23:42:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 2224. [2019-11-15 23:42:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-11-15 23:42:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3616 transitions. [2019-11-15 23:42:39,581 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3616 transitions. Word has length 197 [2019-11-15 23:42:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:39,582 INFO L462 AbstractCegarLoop]: Abstraction has 2224 states and 3616 transitions. [2019-11-15 23:42:39,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:42:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3616 transitions. [2019-11-15 23:42:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 23:42:39,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:39,589 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:39,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:39,805 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash -564251390, now seen corresponding path program 1 times [2019-11-15 23:42:39,806 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:39,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1239387022] [2019-11-15 23:42:39,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:44,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:42:44,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:44,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:42:44,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 [2019-11-15 23:42:44,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:44,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:42:44,544 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:44,544 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:42:44,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:44,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:42:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:42:44,619 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:44,649 INFO L375 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 [2019-11-15 23:42:44,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:44,654 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:44,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:44,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:42:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:42:44,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1239387022] [2019-11-15 23:42:44,687 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:44,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:42:44,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32630898] [2019-11-15 23:42:44,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:42:44,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:42:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:42:44,689 INFO L87 Difference]: Start difference. First operand 2224 states and 3616 transitions. Second operand 7 states. [2019-11-15 23:42:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:58,457 INFO L93 Difference]: Finished difference Result 5748 states and 9068 transitions. [2019-11-15 23:42:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:42:58,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-11-15 23:42:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:58,477 INFO L225 Difference]: With dead ends: 5748 [2019-11-15 23:42:58,477 INFO L226 Difference]: Without dead ends: 3532 [2019-11-15 23:42:58,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:42:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2019-11-15 23:42:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 2323. [2019-11-15 23:42:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-11-15 23:42:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3805 transitions. [2019-11-15 23:42:58,577 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3805 transitions. Word has length 198 [2019-11-15 23:42:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:58,578 INFO L462 AbstractCegarLoop]: Abstraction has 2323 states and 3805 transitions. [2019-11-15 23:42:58,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:42:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3805 transitions. [2019-11-15 23:42:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 23:42:58,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:58,585 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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] [2019-11-15 23:42:58,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:58,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1572060279, now seen corresponding path program 2 times [2019-11-15 23:42:58,802 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:58,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2003010610] [2019-11-15 23:42:58,803 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:59,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:42:59,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:42:59,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:42:59,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:59,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-15 23:42:59,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:59,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:42:59,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:42:59,641 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:42:59,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:59,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:42:59,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:59,681 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:42:59,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:42:59,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:42:59,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:42:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-15 23:42:59,810 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-11-15 23:42:59,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003010610] [2019-11-15 23:42:59,888 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:59,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 23:42:59,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836689699] [2019-11-15 23:42:59,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:42:59,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:42:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:42:59,890 INFO L87 Difference]: Start difference. First operand 2323 states and 3805 transitions. Second operand 8 states. [2019-11-15 23:43:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:43:15,139 INFO L93 Difference]: Finished difference Result 6442 states and 10246 transitions. [2019-11-15 23:43:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:43:15,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226 [2019-11-15 23:43:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:43:15,163 INFO L225 Difference]: With dead ends: 6442 [2019-11-15 23:43:15,164 INFO L226 Difference]: Without dead ends: 4127 [2019-11-15 23:43:15,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:43:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4127 states. [2019-11-15 23:43:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4127 to 2523. [2019-11-15 23:43:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-11-15 23:43:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4121 transitions. [2019-11-15 23:43:15,275 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 4121 transitions. Word has length 226 [2019-11-15 23:43:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:43:15,275 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 4121 transitions. [2019-11-15 23:43:15,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:43:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4121 transitions. [2019-11-15 23:43:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 23:43:15,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:43:15,282 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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] [2019-11-15 23:43:15,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:43:15,498 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:43:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:43:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1580059253, now seen corresponding path program 1 times [2019-11-15 23:43:15,498 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:43:15,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [818807265] [2019-11-15 23:43:15,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:43:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:43:19,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:43:19,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:43:19,750 INFO L375 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 10 treesize of output 8 [2019-11-15 23:43:19,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:19,934 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 23:43:19,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:19,936 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_210|], 2=[|v_#memory_$Pointer$.base_207|, |v_#memory_$Pointer$.base_206|]} [2019-11-15 23:43:19,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:19,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:43:19,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:43:20,106 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:43:20,166 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,183 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-11-15 23:43:20,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,194 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:43:20,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 23:43:20,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,205 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:43:20,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-11-15 23:43:20,216 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,239 INFO L375 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 35 treesize of output 23 [2019-11-15 23:43:20,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-11-15 23:43:20,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,268 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:43:20,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,290 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:43:20,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:32 [2019-11-15 23:43:20,324 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_215|], 6=[|v_#memory_int_239|]} [2019-11-15 23:43:20,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,330 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:43:20,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,357 INFO L375 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 32 treesize of output 34 [2019-11-15 23:43:20,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:41 [2019-11-15 23:43:20,418 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.base_216|], 18=[|v_#memory_int_240|]} [2019-11-15 23:43:20,423 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,511 INFO L375 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 35 treesize of output 23 [2019-11-15 23:43:20,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2019-11-15 23:43:20,566 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,595 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:41 [2019-11-15 23:43:20,634 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_206|, |v_#memory_$Pointer$.base_217|], 12=[|v_#memory_int_241|]} [2019-11-15 23:43:20,641 INFO L375 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 31 treesize of output 25 [2019-11-15 23:43:20,642 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,674 INFO L375 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 36 treesize of output 18 [2019-11-15 23:43:20,674 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-15 23:43:20,702 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,720 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:44 [2019-11-15 23:43:20,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2019-11-15 23:43:20,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:20,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,796 INFO L496 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. [2019-11-15 23:43:20,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:44 [2019-11-15 23:43:20,857 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_207|, |v_#memory_$Pointer$.base_218|], 30=[|v_#memory_int_243|]} [2019-11-15 23:43:20,865 INFO L375 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 31 treesize of output 25 [2019-11-15 23:43:20,866 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,930 INFO L375 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 25 treesize of output 19 [2019-11-15 23:43:20,930 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:20,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:20,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:20,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:21,162 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-15 23:43:21,162 INFO L341 Elim1Store]: treesize reduction 34, result has 68.5 percent of original size [2019-11-15 23:43:21,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 122 [2019-11-15 23:43:21,163 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:41,458 WARN L191 SmtUtils]: Spent 20.29 s on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-15 23:43:41,458 INFO L567 ElimStorePlain]: treesize reduction 56, result has 63.2 percent of original size [2019-11-15 23:43:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,462 INFO L496 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. [2019-11-15 23:43:41,463 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:96 [2019-11-15 23:43:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:44,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:47,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:43:49,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2019-11-15 23:43:49,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2019-11-15 23:43:49,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,350 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2019-11-15 23:43:49,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:49,351 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2019-11-15 23:43:49,426 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 73 [2019-11-15 23:43:49,537 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,588 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 47 [2019-11-15 23:43:49,589 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 88 [2019-11-15 23:43:49,688 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 60 [2019-11-15 23:43:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:43:49,783 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:43:49,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:49,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 75 [2019-11-15 23:43:49,855 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,904 INFO L567 ElimStorePlain]: treesize reduction 195, result has 3.9 percent of original size [2019-11-15 23:43:49,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:43:49,904 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:565, output treesize:3 [2019-11-15 23:43:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 294 proven. 182 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 23:43:50,267 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:43:50,304 INFO L375 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 32 treesize of output 26 [2019-11-15 23:43:50,304 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,309 INFO L375 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 26 treesize of output 20 [2019-11-15 23:43:50,309 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:20 [2019-11-15 23:43:50,356 INFO L375 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 37 treesize of output 31 [2019-11-15 23:43:50,356 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2019-11-15 23:43:50,439 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,505 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,519 INFO L496 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. [2019-11-15 23:43:50,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:81 [2019-11-15 23:43:50,646 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:61 [2019-11-15 23:43:50,740 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:66 [2019-11-15 23:43:50,816 INFO L375 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 118 treesize of output 100 [2019-11-15 23:43:50,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:43:50,845 INFO L567 ElimStorePlain]: treesize reduction 65, result has 27.0 percent of original size [2019-11-15 23:43:50,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:15 [2019-11-15 23:43:50,884 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_229|], 2=[|v_#memory_$Pointer$.base_208|]} [2019-11-15 23:43:50,890 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,908 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,912 INFO L496 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. [2019-11-15 23:43:50,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-15 23:43:50,944 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:50,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:50,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-11-15 23:43:50,998 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:51,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:43:51,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:43:51,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-11-15 23:43:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 294 proven. 136 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 23:43:51,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [818807265] [2019-11-15 23:43:51,165 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:43:51,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-11-15 23:43:51,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565352675] [2019-11-15 23:43:51,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:43:51,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:43:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:43:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:43:51,166 INFO L87 Difference]: Start difference. First operand 2523 states and 4121 transitions. Second operand 15 states. [2019-11-15 23:45:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:03,730 INFO L93 Difference]: Finished difference Result 13549 states and 21534 transitions. [2019-11-15 23:45:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:45:03,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 226 [2019-11-15 23:45:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:03,752 INFO L225 Difference]: With dead ends: 13549 [2019-11-15 23:45:03,752 INFO L226 Difference]: Without dead ends: 11034 [2019-11-15 23:45:03,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 392 SyntacticMatches, 45 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=187, Invalid=514, Unknown=1, NotChecked=0, Total=702 [2019-11-15 23:45:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-11-15 23:45:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 7057. [2019-11-15 23:45:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-11-15 23:45:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 11616 transitions. [2019-11-15 23:45:04,104 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 11616 transitions. Word has length 226 [2019-11-15 23:45:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:04,105 INFO L462 AbstractCegarLoop]: Abstraction has 7057 states and 11616 transitions. [2019-11-15 23:45:04,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:45:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 11616 transitions. [2019-11-15 23:45:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-15 23:45:04,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:04,123 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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] [2019-11-15 23:45:04,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:04,345 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -900786999, now seen corresponding path program 1 times [2019-11-15 23:45:04,346 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:45:04,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [923304166] [2019-11-15 23:45:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:10,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:45:10,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:10,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:10,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 19 [2019-11-15 23:45:10,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:10,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:45:10,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:10,447 INFO L375 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:45:10,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:10,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:45:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 23:45:10,521 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:45:10,558 INFO L375 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 [2019-11-15 23:45:10,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:10,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:10,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:10,568 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:45:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 23:45:10,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923304166] [2019-11-15 23:45:10,645 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:10,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:45:10,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951602543] [2019-11-15 23:45:10,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:45:10,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:45:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:45:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:45:10,646 INFO L87 Difference]: Start difference. First operand 7057 states and 11616 transitions. Second operand 7 states. [2019-11-15 23:45:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:19,980 INFO L93 Difference]: Finished difference Result 19268 states and 31032 transitions. [2019-11-15 23:45:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:45:19,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 226 [2019-11-15 23:45:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:20,005 INFO L225 Difference]: With dead ends: 19268 [2019-11-15 23:45:20,005 INFO L226 Difference]: Without dead ends: 12219 [2019-11-15 23:45:20,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:45:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12219 states. [2019-11-15 23:45:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12219 to 8785. [2019-11-15 23:45:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8785 states. [2019-11-15 23:45:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8785 states to 8785 states and 14478 transitions. [2019-11-15 23:45:20,444 INFO L78 Accepts]: Start accepts. Automaton has 8785 states and 14478 transitions. Word has length 226 [2019-11-15 23:45:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 8785 states and 14478 transitions. [2019-11-15 23:45:20,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:45:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8785 states and 14478 transitions. [2019-11-15 23:45:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-15 23:45:20,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:20,478 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-15 23:45:20,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:20,699 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1441915423, now seen corresponding path program 1 times [2019-11-15 23:45:20,699 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:45:20,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [126255711] [2019-11-15 23:45:20,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1d6eb4b0-8739-4696-ace9-16b36ba8d218/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 23:45:23,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:45:24,048 INFO L235 Elim1Store]: Index analysis took 129 ms [2019-11-15 23:45:24,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:24,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 23:45:24,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:25,617 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 23:45:25,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:25,620 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_232|, |v_#memory_$Pointer$.base_242|], 2=[|v_#memory_$Pointer$.base_240|, |v_#memory_$Pointer$.offset_228|, |v_#memory_$Pointer$.offset_229|, |v_#memory_$Pointer$.base_239|]} [2019-11-15 23:45:25,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:25,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:25,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:25,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:25,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:25,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:26,022 INFO L235 Elim1Store]: Index analysis took 333 ms [2019-11-15 23:45:26,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:45:26,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:27,600 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:45:27,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:27,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:27,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:27,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:27,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:27,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:27,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:28,020 INFO L235 Elim1Store]: Index analysis took 355 ms [2019-11-15 23:45:28,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 23:45:28,501 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:29,562 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:45:29,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:29,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:29,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:45:29,765 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,206 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:45:30,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:45:30,286 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,447 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 23:45:30,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:45:30,474 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 23:45:30,592 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,637 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-15 23:45:30,661 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_233|], 12=[|v_#memory_$Pointer$.base_243|]} [2019-11-15 23:45:30,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,673 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:45:30,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 23:45:30,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 23:45:30,762 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_234|], 12=[|v_#memory_$Pointer$.base_244|]} [2019-11-15 23:45:30,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,774 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:45:30,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:30,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 23:45:30,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:30,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:30,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 23:45:30,857 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_230|, |v_#memory_$Pointer$.base_241|, |v_#memory_$Pointer$.offset_235|], 12=[|v_#memory_$Pointer$.base_245|]} [2019-11-15 23:45:30,878 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:31,151 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 23:45:31,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,158 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:31,320 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 23:45:31,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,357 INFO L375 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 34 treesize of output 22 [2019-11-15 23:45:31,358 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,475 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 23:45:31,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 23:45:31,489 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,517 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-15 23:45:31,521 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_236|], 12=[|v_#memory_$Pointer$.base_246|]} [2019-11-15 23:45:31,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,546 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:45:31,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 23:45:31,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 23:45:31,671 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_237|], 12=[|v_#memory_$Pointer$.base_247|]} [2019-11-15 23:45:31,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,689 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:45:31,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 23:45:31,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 23:45:31,827 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_248|], 12=[|v_#memory_$Pointer$.offset_238|]} [2019-11-15 23:45:31,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 48 [2019-11-15 23:45:31,839 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:31,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:31,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-11-15 23:45:31,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:31,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:31,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:31,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:52 [2019-11-15 23:45:32,014 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_231|], 20=[|v_#memory_$Pointer$.offset_239|]} [2019-11-15 23:45:32,020 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:32,146 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 23:45:32,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-11-15 23:45:32,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:32,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:44 [2019-11-15 23:45:32,276 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_265|], 20=[|v_#memory_$Pointer$.offset_240|]} [2019-11-15 23:45:32,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-15 23:45:32,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-11-15 23:45:32,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:32,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:53 [2019-11-15 23:45:32,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_249|], 2=[|v_#memory_int_266|], 12=[|v_#memory_$Pointer$.offset_241|]} [2019-11-15 23:45:32,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 19 [2019-11-15 23:45:32,523 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:32,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,609 INFO L375 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 29 treesize of output 28 [2019-11-15 23:45:32,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-11-15 23:45:32,695 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:32,719 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-11-15 23:45:32,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:45:32,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,748 INFO L375 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 1 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 23:45:32,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,759 INFO L496 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. [2019-11-15 23:45:32,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-15 23:45:32,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:45:32,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:32,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:45:32,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-11-15 23:45:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 254 proven. 160 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:45:33,157 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:45:33,212 INFO L375 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 26 [2019-11-15 23:45:33,212 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:33,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:33,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:33,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2019-11-15 23:45:33,251 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:33,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:33,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:45:33,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:33,270 INFO L496 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. [2019-11-15 23:45:33,270 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:23 [2019-11-15 23:45:34,457 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_248|], 2=[|v_#memory_$Pointer$.offset_231|]} [2019-11-15 23:45:34,460 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:34,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:34,474 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:34,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:34,478 INFO L496 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. [2019-11-15 23:45:34,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-11-15 23:45:34,629 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_258|], 20=[|v_#memory_$Pointer$.offset_250|]} [2019-11-15 23:45:34,635 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:34,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:34,680 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:34,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:34,690 INFO L496 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. [2019-11-15 23:45:34,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-11-15 23:45:34,920 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_259|], 1=[|v_#memory_$Pointer$.offset_251|]} [2019-11-15 23:45:34,926 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:34,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:34,987 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:45:35,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:45:35,005 INFO L496 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. [2019-11-15 23:45:35,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-11-15 23:45:37,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:37,435 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-11-15 23:45:37,438 INFO L168 Benchmark]: Toolchain (without parser) took 237890.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 942.8 MB in the beginning and 848.7 MB in the end (delta: 94.2 MB). Peak memory consumption was 444.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,439 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:37,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.40 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,441 INFO L168 Benchmark]: Boogie Preprocessor took 112.33 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,441 INFO L168 Benchmark]: RCFGBuilder took 2588.81 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: 96.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,443 INFO L168 Benchmark]: TraceAbstraction took 234285.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 848.7 MB in the end (delta: 175.9 MB). Peak memory consumption was 365.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:37,445 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 784.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 942.8 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.40 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.33 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2588.81 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: 96.2 MB). Peak memory consumption was 96.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 234285.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 848.7 MB in the end (delta: 175.9 MB). Peak memory consumption was 365.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...