/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:57:41,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:57:41,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:57:41,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:57:41,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:57:41,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:57:41,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:57:41,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:57:41,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:57:41,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:57:41,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:57:41,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:57:41,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:57:41,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:57:41,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:57:41,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:57:41,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:57:41,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:57:41,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:57:41,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:57:41,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:57:41,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:57:41,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:57:41,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:57:41,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:57:41,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:57:41,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:57:41,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:57:41,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:57:41,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:57:41,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:57:41,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:57:41,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:57:41,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:57:41,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:57:41,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:57:41,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:57:41,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:57:41,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:57:41,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:57:41,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:57:41,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:57:41,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:57:41,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:57:41,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:57:41,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:57:41,659 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:57:41,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:57:41,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:57:41,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:57:41,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:57:41,663 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:57:41,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:57:41,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:57:41,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:57:41,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:57:41,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:57:41,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:57:41,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:57:41,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:41,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:57:41,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:57:41,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:57:41,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:57:41,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:57:41,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:57:41,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:57:41,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:57:41,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:57:41,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:57:41,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:57:41,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:57:41,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-11-23 21:57:42,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a752bf6/00da86fb107e4d56a4675c96b85f7bd4/FLAGa6f8f7e21 [2019-11-23 21:57:42,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:57:42,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-2.i [2019-11-23 21:57:42,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a752bf6/00da86fb107e4d56a4675c96b85f7bd4/FLAGa6f8f7e21 [2019-11-23 21:57:42,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a752bf6/00da86fb107e4d56a4675c96b85f7bd4 [2019-11-23 21:57:42,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:57:42,850 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:57:42,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:42,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:57:42,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:57:42,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71770d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42, skipping insertion in model container [2019-11-23 21:57:42,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:57:42,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:57:43,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:43,348 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:57:43,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:43,511 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:57:43,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43 WrapperNode [2019-11-23 21:57:43,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:43,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:43,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:57:43,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:57:43,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:43,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:57:43,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:57:43,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:57:43,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:57:43,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:57:43,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:57:43,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:57:43,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:57:43,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:57:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:57:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:57:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:57:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:57:43,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:57:44,008 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:57:44,008 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-23 21:57:44,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:44 BoogieIcfgContainer [2019-11-23 21:57:44,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:57:44,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:57:44,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:57:44,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:57:44,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:57:42" (1/3) ... [2019-11-23 21:57:44,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:44, skipping insertion in model container [2019-11-23 21:57:44,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (2/3) ... [2019-11-23 21:57:44,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fa2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:44, skipping insertion in model container [2019-11-23 21:57:44,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:44" (3/3) ... [2019-11-23 21:57:44,017 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2019-11-23 21:57:44,026 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:57:44,032 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:57:44,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:57:44,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:57:44,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:57:44,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:57:44,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:57:44,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:57:44,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:57:44,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:57:44,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:57:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-23 21:57:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 21:57:44,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,083 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2119917736, now seen corresponding path program 1 times [2019-11-23 21:57:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901313497] [2019-11-23 21:57:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,219 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-23 21:57:44,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901313497] [2019-11-23 21:57:44,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:57:44,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256565747] [2019-11-23 21:57:44,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:57:44,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:57:44,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:57:44,247 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-11-23 21:57:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,268 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-23 21:57:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:57:44,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 21:57:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,280 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:57:44,280 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 21:57:44,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:57:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 21:57:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-23 21:57:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-23 21:57:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-23 21:57:44,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2019-11-23 21:57:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,322 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-23 21:57:44,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:57:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-23 21:57:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:57:44,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash -624123943, now seen corresponding path program 1 times [2019-11-23 21:57:44,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449609494] [2019-11-23 21:57:44,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,387 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-23 21:57:44,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449609494] [2019-11-23 21:57:44,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:44,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168156464] [2019-11-23 21:57:44,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:44,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:44,394 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2019-11-23 21:57:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,419 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-23 21:57:44,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:44,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 21:57:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,421 INFO L225 Difference]: With dead ends: 28 [2019-11-23 21:57:44,421 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 21:57:44,422 INFO L630 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-23 21:57:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 21:57:44,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-23 21:57:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 21:57:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-23 21:57:44,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2019-11-23 21:57:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,427 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-23 21:57:44,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-23 21:57:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:57:44,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,429 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -566865641, now seen corresponding path program 1 times [2019-11-23 21:57:44,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920203403] [2019-11-23 21:57:44,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,481 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-23 21:57:44,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920203403] [2019-11-23 21:57:44,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:57:44,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007260065] [2019-11-23 21:57:44,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:57:44,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:57:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:57:44,484 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-11-23 21:57:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,564 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-11-23 21:57:44,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 21:57:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,566 INFO L225 Difference]: With dead ends: 39 [2019-11-23 21:57:44,566 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 21:57:44,567 INFO L630 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-23 21:57:44,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 21:57:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-23 21:57:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:57:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 21:57:44,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 21:57:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,571 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 21:57:44,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:57:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 21:57:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:57:44,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,572 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1327995320, now seen corresponding path program 1 times [2019-11-23 21:57:44,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740301922] [2019-11-23 21:57:44,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:44,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740301922] [2019-11-23 21:57:44,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:57:44,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947749549] [2019-11-23 21:57:44,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:57:44,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:57:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:57:44,684 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-23 21:57:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,754 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-23 21:57:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:57:44,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 21:57:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,757 INFO L225 Difference]: With dead ends: 32 [2019-11-23 21:57:44,757 INFO L226 Difference]: Without dead ends: 29 [2019-11-23 21:57:44,757 INFO L630 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-23 21:57:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-23 21:57:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-11-23 21:57:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 21:57:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 21:57:44,765 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-11-23 21:57:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,765 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 21:57:44,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:57:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 21:57:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:57:44,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,768 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,770 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash -713840769, now seen corresponding path program 1 times [2019-11-23 21:57:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202245028] [2019-11-23 21:57:44,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:44,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202245028] [2019-11-23 21:57:44,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:57:44,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55948068] [2019-11-23 21:57:44,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:44,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:44,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,875 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-11-23 21:57:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,953 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-23 21:57:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-23 21:57:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,955 INFO L225 Difference]: With dead ends: 33 [2019-11-23 21:57:44,955 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 21:57:44,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 21:57:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-23 21:57:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 21:57:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-23 21:57:44,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2019-11-23 21:57:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,974 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-23 21:57:44,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-23 21:57:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:57:44,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,975 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -711993727, now seen corresponding path program 1 times [2019-11-23 21:57:44,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173663189] [2019-11-23 21:57:44,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173663189] [2019-11-23 21:57:45,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298443975] [2019-11-23 21:57:45,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:57:45,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:45,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:57:45,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443165571] [2019-11-23 21:57:45,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:57:45,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:57:45,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:45,162 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2019-11-23 21:57:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,251 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-11-23 21:57:45,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:57:45,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-23 21:57:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,255 INFO L225 Difference]: With dead ends: 50 [2019-11-23 21:57:45,255 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 21:57:45,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:57:45,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 21:57:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-23 21:57:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 21:57:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-23 21:57:45,267 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2019-11-23 21:57:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,267 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-23 21:57:45,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:57:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-23 21:57:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:57:45,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,270 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,473 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2011045262, now seen corresponding path program 2 times [2019-11-23 21:57:45,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830485366] [2019-11-23 21:57:45,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830485366] [2019-11-23 21:57:45,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214543594] [2019-11-23 21:57:45,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:45,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:45,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:45,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:57:45,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:45,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:45,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 21:57:45,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096422638] [2019-11-23 21:57:45,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:57:45,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:57:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:45,665 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2019-11-23 21:57:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,755 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-23 21:57:45,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:57:45,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 21:57:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,756 INFO L225 Difference]: With dead ends: 55 [2019-11-23 21:57:45,757 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:57:45,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:57:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-23 21:57:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 21:57:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-23 21:57:45,763 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2019-11-23 21:57:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-23 21:57:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:57:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-23 21:57:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:57:45,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,764 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash 22979873, now seen corresponding path program 3 times [2019-11-23 21:57:45,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116680195] [2019-11-23 21:57:45,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:46,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116680195] [2019-11-23 21:57:46,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851502160] [2019-11-23 21:57:46,082 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:46,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:57:46,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:46,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:46,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-23 21:57:46,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637613384] [2019-11-23 21:57:46,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:57:46,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:57:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:57:46,200 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2019-11-23 21:57:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,315 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-23 21:57:46,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:57:46,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-23 21:57:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,318 INFO L225 Difference]: With dead ends: 60 [2019-11-23 21:57:46,319 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 21:57:46,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:57:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 21:57:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-23 21:57:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 21:57:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-23 21:57:46,328 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2019-11-23 21:57:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,328 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-23 21:57:46,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:57:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-23 21:57:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:57:46,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,333 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:46,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 611006418, now seen corresponding path program 4 times [2019-11-23 21:57:46,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592253592] [2019-11-23 21:57:46,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:46,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592253592] [2019-11-23 21:57:46,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485698911] [2019-11-23 21:57:46,639 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:46,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:57:46,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:46,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:57:46,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:46,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-23 21:57:46,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,931 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:57:46,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:57:47,010 INFO L377 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-23 21:57:47,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,027 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-23 21:57:47,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-11-23 21:57:47,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-23 21:57:47,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,176 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-11-23 21:57:47,208 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:57:47,209 INFO L377 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 1 case distinctions, treesize of input 66 treesize of output 40 [2019-11-23 21:57:47,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,255 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-23 21:57:47,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-11-23 21:57:47,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2019-11-23 21:57:47,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,392 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-11-23 21:57:47,394 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-23 21:57:47,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-11-23 21:57:47,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-11-23 21:57:47,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,666 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-23 21:57:47,667 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-11-23 21:57:47,734 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-23 21:57:47,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 95 [2019-11-23 21:57:47,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,772 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-23 21:57:47,837 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-11-23 21:57:47,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:47,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-11-23 21:57:47,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,968 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 161 [2019-11-23 21:57:47,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:57:48,098 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-11-23 21:57:48,099 INFO L567 ElimStorePlain]: treesize reduction 617, result has 21.8 percent of original size [2019-11-23 21:57:48,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-11-23 21:57:48,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-11-23 21:57:48,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,374 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-23 21:57:48,375 INFO L343 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-11-23 21:57:48,376 INFO L377 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 6 case distinctions, treesize of input 227 treesize of output 155 [2019-11-23 21:57:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,394 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-23 21:57:48,520 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-23 21:57:48,521 INFO L567 ElimStorePlain]: treesize reduction 98, result has 49.5 percent of original size [2019-11-23 21:57:48,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-11-23 21:57:48,759 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-23 21:57:48,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,760 INFO L377 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-11-23 21:57:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,039 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-11-23 21:57:49,041 INFO L567 ElimStorePlain]: treesize reduction 8011, result has 3.0 percent of original size [2019-11-23 21:57:49,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:49,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-11-23 21:57:49,118 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_10|], 20=[|v_#memory_$Pointer$.base_18|]} [2019-11-23 21:57:49,124 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-23 21:57:49,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,569 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-11-23 21:57:49,571 INFO L343 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-11-23 21:57:49,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-11-23 21:57:49,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-23 21:57:50,860 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-11-23 21:57:50,861 INFO L567 ElimStorePlain]: treesize reduction 257971, result has 0.1 percent of original size [2019-11-23 21:57:50,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:50,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-11-23 21:57:50,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 295 treesize of output 215 [2019-11-23 21:57:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:51,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:51,679 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 8 [2019-11-23 21:57:51,679 INFO L567 ElimStorePlain]: treesize reduction 16507, result has 0.1 percent of original size [2019-11-23 21:57:51,680 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-23 21:57:51,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-11-23 21:57:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:51,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:51,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-11-23 21:57:51,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049458368] [2019-11-23 21:57:51,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 21:57:51,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 21:57:51,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:57:51,739 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 21 states. [2019-11-23 21:57:52,864 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-23 21:57:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:53,362 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-11-23 21:57:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:57:53,363 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-11-23 21:57:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:53,366 INFO L225 Difference]: With dead ends: 71 [2019-11-23 21:57:53,367 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 21:57:53,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 21:57:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 21:57:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-23 21:57:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 21:57:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-23 21:57:53,383 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 36 [2019-11-23 21:57:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:53,385 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-23 21:57:53,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 21:57:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-23 21:57:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:57:53,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:53,387 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:53,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:53,593 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:53,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1517530049, now seen corresponding path program 5 times [2019-11-23 21:57:53,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683722405] [2019-11-23 21:57:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:53,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683722405] [2019-11-23 21:57:53,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841690491] [2019-11-23 21:57:53,797 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:54,113 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 21:57:54,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:54,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:57:54,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:54,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:54,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:54,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-23 21:57:54,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661187661] [2019-11-23 21:57:54,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:54,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:54,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:54,151 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2019-11-23 21:57:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:54,334 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-23 21:57:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:57:54,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-23 21:57:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:54,336 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:57:54,336 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 21:57:54,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 21:57:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-23 21:57:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 21:57:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-23 21:57:54,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 41 [2019-11-23 21:57:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:54,349 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-23 21:57:54,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-23 21:57:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 21:57:54,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:54,353 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:54,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:54,564 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2123453746, now seen corresponding path program 6 times [2019-11-23 21:57:54,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:54,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074827474] [2019-11-23 21:57:54,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:54,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074827474] [2019-11-23 21:57:54,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359784627] [2019-11-23 21:57:54,684 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:55,552 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-23 21:57:55,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:55,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 21:57:55,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:55,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:55,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:55,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-23 21:57:55,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659828585] [2019-11-23 21:57:55,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:57:55,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:57:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:57:55,572 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2019-11-23 21:57:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:55,735 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-11-23 21:57:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:57:55,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-23 21:57:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:55,737 INFO L225 Difference]: With dead ends: 75 [2019-11-23 21:57:55,737 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 21:57:55,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 21:57:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-23 21:57:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 21:57:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-23 21:57:55,753 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 46 [2019-11-23 21:57:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:55,754 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-23 21:57:55,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:57:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-23 21:57:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 21:57:55,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:55,757 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:55,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,958 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2006390175, now seen corresponding path program 7 times [2019-11-23 21:57:55,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:55,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667014561] [2019-11-23 21:57:55,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667014561] [2019-11-23 21:57:56,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403590927] [2019-11-23 21:57:56,085 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:57:56,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:56,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,189 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-23 21:57:56,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655906373] [2019-11-23 21:57:56,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:57:56,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:57:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:57:56,192 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 12 states. [2019-11-23 21:57:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:56,361 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-23 21:57:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:57:56,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-23 21:57:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:56,363 INFO L225 Difference]: With dead ends: 80 [2019-11-23 21:57:56,363 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 21:57:56,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:57:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 21:57:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-11-23 21:57:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-23 21:57:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-23 21:57:56,372 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 51 [2019-11-23 21:57:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:56,372 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-23 21:57:56,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:57:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-23 21:57:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 21:57:56,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:56,375 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:56,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:56,576 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1623573870, now seen corresponding path program 8 times [2019-11-23 21:57:56,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:56,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699601440] [2019-11-23 21:57:56,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699601440] [2019-11-23 21:57:56,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229844226] [2019-11-23 21:57:56,728 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:56,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:56,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:56,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 21:57:56,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:56,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-23 21:57:56,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097913695] [2019-11-23 21:57:56,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:57:56,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:57:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:57:56,839 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 13 states. [2019-11-23 21:57:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:57,030 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-11-23 21:57:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:57:57,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-23 21:57:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:57,031 INFO L225 Difference]: With dead ends: 85 [2019-11-23 21:57:57,031 INFO L226 Difference]: Without dead ends: 67 [2019-11-23 21:57:57,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:57:57,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-23 21:57:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-11-23 21:57:57,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 21:57:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-23 21:57:57,037 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 56 [2019-11-23 21:57:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:57,038 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-23 21:57:57,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:57:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-23 21:57:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 21:57:57,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:57,039 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:57,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:57,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -94871295, now seen corresponding path program 9 times [2019-11-23 21:57:57,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:57,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245841525] [2019-11-23 21:57:57,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:57,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245841525] [2019-11-23 21:57:57,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345675828] [2019-11-23 21:57:57,395 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:57:59,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 21:57:59,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:59,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 21:57:59,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:59,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:59,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:59,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-23 21:57:59,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528573554] [2019-11-23 21:57:59,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:57:59,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:57:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:57:59,440 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 14 states. [2019-11-23 21:57:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:59,645 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-11-23 21:57:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 21:57:59,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-11-23 21:57:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:59,648 INFO L225 Difference]: With dead ends: 90 [2019-11-23 21:57:59,648 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:57:59,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:57:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:57:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-11-23 21:57:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 21:57:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-23 21:57:59,654 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 61 [2019-11-23 21:57:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:59,654 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-23 21:57:59,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:57:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-23 21:57:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 21:57:59,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:59,655 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:59,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:59,864 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:59,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2005657586, now seen corresponding path program 10 times [2019-11-23 21:57:59,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:59,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164371530] [2019-11-23 21:57:59,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 183 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 21:58:00,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164371530] [2019-11-23 21:58:00,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409118246] [2019-11-23 21:58:00,366 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 21:58:00,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:58:00,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:00,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 120 conjunts are in the unsatisfiable core [2019-11-23 21:58:00,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:00,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:58:00,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:00,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-23 21:58:00,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,798 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-23 21:58:00,806 INFO L377 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 11 treesize of output 7 [2019-11-23 21:58:00,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-23 21:58:00,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:00,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:58:00,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:58:00,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,027 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-23 21:58:01,032 INFO L377 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 19 treesize of output 18 [2019-11-23 21:58:01,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-11-23 21:58:01,111 INFO L377 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 27 treesize of output 11 [2019-11-23 21:58:01,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,127 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-23 21:58:01,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-11-23 21:58:01,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-11-23 21:58:01,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,313 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-11-23 21:58:01,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:01,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,349 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-11-23 21:58:01,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:01,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-11-23 21:58:01,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-11-23 21:58:01,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,695 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-23 21:58:01,696 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-11-23 21:58:01,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:01,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-11-23 21:58:01,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:01,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-11-23 21:58:02,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-11-23 21:58:02,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,278 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-23 21:58:02,278 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-11-23 21:58:02,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:02,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:02,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-11-23 21:58:02,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:02,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:02,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-11-23 21:58:02,855 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-23 21:58:02,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-11-23 21:58:02,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,128 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-23 21:58:03,129 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-11-23 21:58:03,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:03,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:03,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-11-23 21:58:05,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:05,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:05,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:05,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:05,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-11-23 21:58:06,795 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:58:06,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:06,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-11-23 21:58:06,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,261 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-23 21:58:07,262 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-11-23 21:58:07,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:07,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,446 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-23 21:58:07,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:07,449 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-11-23 21:58:10,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:10,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,994 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:58:10,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:10,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-11-23 21:58:14,971 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-23 21:58:14,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-11-23 21:58:14,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,419 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-11-23 21:58:15,421 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-11-23 21:58:15,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:15,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,612 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-23 21:58:15,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:15,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-11-23 21:58:23,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:23,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:23,328 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-23 21:58:23,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:23,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:23,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-11-23 21:58:55,381 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-23 21:58:55,382 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 57 treesize of output 279 [2019-11-23 21:58:55,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,957 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-11-23 21:58:55,958 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-11-23 21:58:55,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:55,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:56,193 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-23 21:58:56,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:56,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:56,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-11-23 21:59:12,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:12,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:12,530 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-23 21:59:12,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:12,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:12,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241