java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:55:51,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:55:51,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:55:51,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:55:51,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:55:51,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:55:51,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:55:51,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:55:51,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:55:51,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:55:51,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:55:51,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:55:51,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:55:51,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:55:51,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:55:51,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:55:51,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:55:51,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:55:51,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:55:51,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:55:51,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:55:51,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:55:51,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:55:51,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:55:51,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:55:51,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:55:51,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:55:51,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:55:51,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:55:51,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:55:51,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:55:51,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:55:51,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:55:51,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:55:51,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:55:51,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:55:51,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:55:51,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:55:51,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:55:51,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:55:51,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:55:51,876 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-10-15 01:55:51,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:55:51,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:55:51,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:55:51,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:55:51,902 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:55:51,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:55:51,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:55:51,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:55:51,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:55:51,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:55:51,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:55:51,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:55:51,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:55:51,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:55:51,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:55:51,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:55:51,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:55:51,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:55:51,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:55:51,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:55:51,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:55:51,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:55:51,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:55:51,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:55:51,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:55:51,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:55:51,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:55:51,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:55:51,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 01:55:52,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:55:52,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:55:52,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:55:52,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:55:52,206 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:55:52,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label19.c [2019-10-15 01:55:52,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f578e569/4de053b2fbb54b02a163b90d38267ba2/FLAG1e7489716 [2019-10-15 01:55:52,971 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:55:52,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label19.c [2019-10-15 01:55:52,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f578e569/4de053b2fbb54b02a163b90d38267ba2/FLAG1e7489716 [2019-10-15 01:55:53,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f578e569/4de053b2fbb54b02a163b90d38267ba2 [2019-10-15 01:55:53,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:55:53,244 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:55:53,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:55:53,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:55:53,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:55:53,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:55:53" (1/1) ... [2019-10-15 01:55:53,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb7c29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:53, skipping insertion in model container [2019-10-15 01:55:53,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:55:53" (1/1) ... [2019-10-15 01:55:53,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:55:53,352 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:55:54,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:55:54,159 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:55:54,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:55:54,483 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:55:54,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54 WrapperNode [2019-10-15 01:55:54,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:55:54,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:55:54,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:55:54,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:55:54,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (1/1) ... [2019-10-15 01:55:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:55:54,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:55:54,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:55:54,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:55:54,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (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-10-15 01:55:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:55:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:55:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 01:55:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-15 01:55:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 01:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-15 01:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:55:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:55:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:56:10,987 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:56:10,988 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:56:10,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:56:10 BoogieIcfgContainer [2019-10-15 01:56:10,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:56:10,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:56:10,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:56:10,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:56:10,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:55:53" (1/3) ... [2019-10-15 01:56:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3b41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:56:10, skipping insertion in model container [2019-10-15 01:56:10,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:55:54" (2/3) ... [2019-10-15 01:56:10,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3b41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:56:10, skipping insertion in model container [2019-10-15 01:56:10,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:56:10" (3/3) ... [2019-10-15 01:56:10,998 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label19.c [2019-10-15 01:56:11,005 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:56:11,013 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:56:11,024 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:56:11,052 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:56:11,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:56:11,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:56:11,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:56:11,053 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:56:11,053 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:56:11,053 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:56:11,053 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:56:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2019-10-15 01:56:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:56:11,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:11,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:11,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 863563839, now seen corresponding path program 1 times [2019-10-15 01:56:11,104 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:11,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385657232] [2019-10-15 01:56:11,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:11,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:11,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:11,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385657232] [2019-10-15 01:56:11,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:11,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:56:11,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973379002] [2019-10-15 01:56:11,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:56:11,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:56:11,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:56:11,351 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2019-10-15 01:56:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:14,170 INFO L93 Difference]: Finished difference Result 953 states and 1852 transitions. [2019-10-15 01:56:14,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:56:14,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 01:56:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:14,199 INFO L225 Difference]: With dead ends: 953 [2019-10-15 01:56:14,200 INFO L226 Difference]: Without dead ends: 702 [2019-10-15 01:56:14,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:56:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-15 01:56:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 463. [2019-10-15 01:56:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-15 01:56:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 876 transitions. [2019-10-15 01:56:14,350 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 876 transitions. Word has length 11 [2019-10-15 01:56:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:14,350 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 876 transitions. [2019-10-15 01:56:14,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:56:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 876 transitions. [2019-10-15 01:56:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:56:14,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:14,353 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:14,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2065676307, now seen corresponding path program 1 times [2019-10-15 01:56:14,354 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:14,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50221957] [2019-10-15 01:56:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:14,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:14,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50221957] [2019-10-15 01:56:14,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:14,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:56:14,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706985195] [2019-10-15 01:56:14,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:56:14,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:56:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:56:14,501 INFO L87 Difference]: Start difference. First operand 463 states and 876 transitions. Second operand 5 states. [2019-10-15 01:56:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:17,053 INFO L93 Difference]: Finished difference Result 1395 states and 2674 transitions. [2019-10-15 01:56:17,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:56:17,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-15 01:56:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:17,062 INFO L225 Difference]: With dead ends: 1395 [2019-10-15 01:56:17,062 INFO L226 Difference]: Without dead ends: 937 [2019-10-15 01:56:17,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:56:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-10-15 01:56:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 918. [2019-10-15 01:56:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-10-15 01:56:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1637 transitions. [2019-10-15 01:56:17,135 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1637 transitions. Word has length 21 [2019-10-15 01:56:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:17,136 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1637 transitions. [2019-10-15 01:56:17,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:56:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1637 transitions. [2019-10-15 01:56:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:56:17,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:17,138 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:17,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1116822658, now seen corresponding path program 1 times [2019-10-15 01:56:17,139 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:17,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109818167] [2019-10-15 01:56:17,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:17,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:17,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:17,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109818167] [2019-10-15 01:56:17,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:17,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:56:17,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564013617] [2019-10-15 01:56:17,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:56:17,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:56:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:56:17,276 INFO L87 Difference]: Start difference. First operand 918 states and 1637 transitions. Second operand 6 states. [2019-10-15 01:56:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:19,361 INFO L93 Difference]: Finished difference Result 2531 states and 4571 transitions. [2019-10-15 01:56:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:56:19,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-15 01:56:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:19,373 INFO L225 Difference]: With dead ends: 2531 [2019-10-15 01:56:19,374 INFO L226 Difference]: Without dead ends: 1618 [2019-10-15 01:56:19,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:56:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-15 01:56:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1594. [2019-10-15 01:56:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1594 states. [2019-10-15 01:56:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2779 transitions. [2019-10-15 01:56:19,440 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2779 transitions. Word has length 24 [2019-10-15 01:56:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:19,441 INFO L462 AbstractCegarLoop]: Abstraction has 1594 states and 2779 transitions. [2019-10-15 01:56:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:56:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2779 transitions. [2019-10-15 01:56:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:56:19,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:19,442 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:19,443 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 757409317, now seen corresponding path program 1 times [2019-10-15 01:56:19,443 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:19,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519939336] [2019-10-15 01:56:19,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:19,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:19,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519939336] [2019-10-15 01:56:19,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:19,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:56:19,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639839114] [2019-10-15 01:56:19,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:56:19,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:56:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:56:19,510 INFO L87 Difference]: Start difference. First operand 1594 states and 2779 transitions. Second operand 6 states. [2019-10-15 01:56:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:21,457 INFO L93 Difference]: Finished difference Result 3661 states and 6383 transitions. [2019-10-15 01:56:21,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:56:21,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-15 01:56:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:21,472 INFO L225 Difference]: With dead ends: 3661 [2019-10-15 01:56:21,473 INFO L226 Difference]: Without dead ends: 2072 [2019-10-15 01:56:21,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:56:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-10-15 01:56:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1974. [2019-10-15 01:56:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1974 states. [2019-10-15 01:56:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3150 transitions. [2019-10-15 01:56:21,557 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3150 transitions. Word has length 25 [2019-10-15 01:56:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:21,558 INFO L462 AbstractCegarLoop]: Abstraction has 1974 states and 3150 transitions. [2019-10-15 01:56:21,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:56:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3150 transitions. [2019-10-15 01:56:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:56:21,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:21,560 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:21,561 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:21,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1907035702, now seen corresponding path program 1 times [2019-10-15 01:56:21,561 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:21,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591821063] [2019-10-15 01:56:21,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:21,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:21,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:21,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591821063] [2019-10-15 01:56:21,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:21,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:56:21,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429554565] [2019-10-15 01:56:21,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:56:21,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:56:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:56:21,652 INFO L87 Difference]: Start difference. First operand 1974 states and 3150 transitions. Second operand 6 states. [2019-10-15 01:56:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:23,710 INFO L93 Difference]: Finished difference Result 5108 states and 8377 transitions. [2019-10-15 01:56:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:56:23,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-15 01:56:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:23,733 INFO L225 Difference]: With dead ends: 5108 [2019-10-15 01:56:23,733 INFO L226 Difference]: Without dead ends: 3139 [2019-10-15 01:56:23,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:56:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-10-15 01:56:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3067. [2019-10-15 01:56:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-10-15 01:56:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4847 transitions. [2019-10-15 01:56:23,853 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4847 transitions. Word has length 28 [2019-10-15 01:56:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:23,854 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 4847 transitions. [2019-10-15 01:56:23,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:56:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4847 transitions. [2019-10-15 01:56:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 01:56:23,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:23,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:23,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash -221346906, now seen corresponding path program 1 times [2019-10-15 01:56:23,858 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:23,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917050234] [2019-10-15 01:56:23,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:23,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:23,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:23,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917050234] [2019-10-15 01:56:23,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:23,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:56:23,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589935337] [2019-10-15 01:56:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:56:23,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:23,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:56:23,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:56:23,971 INFO L87 Difference]: Start difference. First operand 3067 states and 4847 transitions. Second operand 6 states. [2019-10-15 01:56:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:26,082 INFO L93 Difference]: Finished difference Result 8110 states and 13134 transitions. [2019-10-15 01:56:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:56:26,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-15 01:56:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:26,108 INFO L225 Difference]: With dead ends: 8110 [2019-10-15 01:56:26,108 INFO L226 Difference]: Without dead ends: 5048 [2019-10-15 01:56:26,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:56:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2019-10-15 01:56:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 4116. [2019-10-15 01:56:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-10-15 01:56:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 6098 transitions. [2019-10-15 01:56:26,252 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 6098 transitions. Word has length 36 [2019-10-15 01:56:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:26,254 INFO L462 AbstractCegarLoop]: Abstraction has 4116 states and 6098 transitions. [2019-10-15 01:56:26,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:56:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 6098 transitions. [2019-10-15 01:56:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:56:26,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:26,265 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:26,267 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -875644383, now seen corresponding path program 1 times [2019-10-15 01:56:26,268 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:26,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540883282] [2019-10-15 01:56:26,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:26,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:26,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:26,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540883282] [2019-10-15 01:56:26,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:56:26,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:56:26,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511410532] [2019-10-15 01:56:26,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:56:26,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:56:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:56:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:56:26,346 INFO L87 Difference]: Start difference. First operand 4116 states and 6098 transitions. Second operand 4 states. [2019-10-15 01:56:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:56:28,552 INFO L93 Difference]: Finished difference Result 9149 states and 13343 transitions. [2019-10-15 01:56:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:56:28,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-15 01:56:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:56:28,577 INFO L225 Difference]: With dead ends: 9149 [2019-10-15 01:56:28,577 INFO L226 Difference]: Without dead ends: 5038 [2019-10-15 01:56:28,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:56:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2019-10-15 01:56:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 4270. [2019-10-15 01:56:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-10-15 01:56:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 5807 transitions. [2019-10-15 01:56:28,712 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 5807 transitions. Word has length 43 [2019-10-15 01:56:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:56:28,714 INFO L462 AbstractCegarLoop]: Abstraction has 4270 states and 5807 transitions. [2019-10-15 01:56:28,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:56:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 5807 transitions. [2019-10-15 01:56:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-15 01:56:28,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:56:28,732 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:56:28,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:56:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:56:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1639791061, now seen corresponding path program 1 times [2019-10-15 01:56:28,734 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:56:28,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368812947] [2019-10-15 01:56:28,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:28,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:56:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:56:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:56:29,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368812947] [2019-10-15 01:56:29,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158594932] [2019-10-15 01:56:29,733 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-10-15 01:56:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:56:29,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-15 01:56:29,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:56:30,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 01:56:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 01:56:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 01:56:30,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:56:30,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-10-15 01:56:30,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms