/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/heap-data/running_example.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:30:30,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:30:30,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:30:30,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:30:30,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:30:30,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:30:30,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:30:30,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:30:30,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:30:30,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:30:30,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:30:30,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:30:30,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:30:30,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:30:30,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:30:30,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:30:30,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:30:30,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:30:30,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:30:30,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:30:30,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:30:30,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:30:30,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:30:30,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:30:30,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:30:30,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:30:30,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:30:30,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:30:30,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:30:30,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:30:30,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:30:30,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:30:30,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:30:30,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:30:30,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:30:30,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:30:30,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:30:30,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:30:30,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:30:30,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:30:30,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:30:30,454 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:30:30,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:30:30,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:30:30,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:30:30,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:30:30,476 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:30:30,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:30:30,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:30:30,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:30:30,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:30:30,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:30:30,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:30:30,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:30:30,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:30:30,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:30:30,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:30:30,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:30:30,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:30:30,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:30:30,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:30:30,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:30:30,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:30:30,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:30:30,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:30:30,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:30:30,485 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:30:30,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:30:30,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:30:30,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:30:30,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:30:30,796 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:30:30,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example.i [2019-11-23 21:30:30,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2667fa6d0/b4ebcc6fdeab4c7f9527125f56f9f420/FLAG1d20f755f [2019-11-23 21:30:31,402 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:30:31,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example.i [2019-11-23 21:30:31,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2667fa6d0/b4ebcc6fdeab4c7f9527125f56f9f420/FLAG1d20f755f [2019-11-23 21:30:31,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2667fa6d0/b4ebcc6fdeab4c7f9527125f56f9f420 [2019-11-23 21:30:31,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:30:31,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:30:31,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:31,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:30:31,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:30:31,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:31" (1/1) ... [2019-11-23 21:30:31,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425ac23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:31, skipping insertion in model container [2019-11-23 21:30:31,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:30:31" (1/1) ... [2019-11-23 21:30:31,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:30:31,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:30:32,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:32,219 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:30:32,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:30:32,336 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:30:32,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32 WrapperNode [2019-11-23 21:30:32,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:30:32,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:32,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:30:32,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:30:32,347 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:30:32" (1/1) ... [2019-11-23 21:30:32,362 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:30:32" (1/1) ... [2019-11-23 21:30:32,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:30:32,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:30:32,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:30:32,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:30:32,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (1/1) ... [2019-11-23 21:30:32,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:30:32,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:30:32,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:30:32,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:30:32,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (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:30:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:30:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:30:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:30:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:30:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:30:32,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:30:32,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:30:32,834 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:30:32,834 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 21:30:32,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:32 BoogieIcfgContainer [2019-11-23 21:30:32,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:30:32,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:30:32,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:30:32,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:30:32,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:30:31" (1/3) ... [2019-11-23 21:30:32,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764aa14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:32, skipping insertion in model container [2019-11-23 21:30:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:30:32" (2/3) ... [2019-11-23 21:30:32,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764aa14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:30:32, skipping insertion in model container [2019-11-23 21:30:32,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:30:32" (3/3) ... [2019-11-23 21:30:32,844 INFO L109 eAbstractionObserver]: Analyzing ICFG running_example.i [2019-11-23 21:30:32,851 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:30:32,858 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:30:32,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:30:32,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:30:32,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:30:32,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:30:32,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:30:32,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:30:32,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:30:32,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:30:32,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:30:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-23 21:30:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 21:30:32,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:32,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:32,915 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 538476752, now seen corresponding path program 1 times [2019-11-23 21:30:32,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:32,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011754222] [2019-11-23 21:30:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:33,073 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:30:33,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011754222] [2019-11-23 21:30:33,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:33,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:30:33,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299981721] [2019-11-23 21:30:33,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:30:33,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:30:33,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:30:33,100 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-23 21:30:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:33,120 INFO L93 Difference]: Finished difference Result 27 states and 43 transitions. [2019-11-23 21:30:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:30:33,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-23 21:30:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:33,132 INFO L225 Difference]: With dead ends: 27 [2019-11-23 21:30:33,133 INFO L226 Difference]: Without dead ends: 15 [2019-11-23 21:30:33,136 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:30:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-23 21:30:33,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-23 21:30:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-23 21:30:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-23 21:30:33,174 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 8 [2019-11-23 21:30:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:33,174 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-23 21:30:33,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:30:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-11-23 21:30:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 21:30:33,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:33,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:33,176 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1314112902, now seen corresponding path program 1 times [2019-11-23 21:30:33,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:33,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55253020] [2019-11-23 21:30:33,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:33,303 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:30:33,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55253020] [2019-11-23 21:30:33,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:33,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:30:33,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153137705] [2019-11-23 21:30:33,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:30:33,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:30:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:30:33,310 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 6 states. [2019-11-23 21:30:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:33,467 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-23 21:30:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:30:33,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-23 21:30:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:33,471 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:30:33,471 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 21:30:33,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 21:30:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-23 21:30:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-23 21:30:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-23 21:30:33,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2019-11-23 21:30:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:33,479 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-23 21:30:33,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:30:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-23 21:30:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 21:30:33,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:33,481 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:33,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:33,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1215852288, now seen corresponding path program 1 times [2019-11-23 21:30:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597507299] [2019-11-23 21:30:33,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:33,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597507299] [2019-11-23 21:30:33,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099194330] [2019-11-23 21:30:33,744 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:30:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:33,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 21:30:33,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:33,919 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:30:33,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,944 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:30:33,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:33,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:33,960 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:30:33,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-11-23 21:30:34,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:34,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,070 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:30:34,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,106 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:34,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:34,158 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:30:34,158 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 1 case distinctions, treesize of input 44 treesize of output 36 [2019-11-23 21:30:34,159 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,180 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:11 [2019-11-23 21:30:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:34,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:34,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-11-23 21:30:34,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420001862] [2019-11-23 21:30:34,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:30:34,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:30:34,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:30:34,242 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 10 states. [2019-11-23 21:30:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:34,502 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2019-11-23 21:30:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:30:34,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-23 21:30:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:34,504 INFO L225 Difference]: With dead ends: 48 [2019-11-23 21:30:34,504 INFO L226 Difference]: Without dead ends: 39 [2019-11-23 21:30:34,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:30:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-23 21:30:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-11-23 21:30:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-23 21:30:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-11-23 21:30:34,511 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2019-11-23 21:30:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:34,512 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-11-23 21:30:34,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:30:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-11-23 21:30:34,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:30:34,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:34,513 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:34,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:34,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 658296035, now seen corresponding path program 1 times [2019-11-23 21:30:34,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:34,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607073799] [2019-11-23 21:30:34,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:34,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607073799] [2019-11-23 21:30:34,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643750769] [2019-11-23 21:30:34,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:34,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 21:30:34,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:34,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:34,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-11-23 21:30:34,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:34,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-11-23 21:30:34,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:34,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:34,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2019-11-23 21:30:35,022 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 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:30:35,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:35,038 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 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:30:35,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:35,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2019-11-23 21:30:35,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:35,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:35,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-23 21:30:35,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:35,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-23 21:30:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:35,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:35,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:30:35,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853724211] [2019-11-23 21:30:35,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:30:35,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:30:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:30:35,085 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2019-11-23 21:30:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:35,269 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2019-11-23 21:30:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 21:30:35,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 21:30:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:35,272 INFO L225 Difference]: With dead ends: 54 [2019-11-23 21:30:35,272 INFO L226 Difference]: Without dead ends: 45 [2019-11-23 21:30:35,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:30:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-23 21:30:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-23 21:30:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 21:30:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-23 21:30:35,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 16 [2019-11-23 21:30:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:35,300 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-23 21:30:35,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:30:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-11-23 21:30:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:35,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:35,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:35,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:35,510 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1194606685, now seen corresponding path program 1 times [2019-11-23 21:30:35,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:35,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726789817] [2019-11-23 21:30:35,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:35,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726789817] [2019-11-23 21:30:35,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473947768] [2019-11-23 21:30:35,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:35,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-23 21:30:35,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:35,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:30:35,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:35,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:35,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-23 21:30:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-23 21:30:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156160188] [2019-11-23 21:30:35,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:30:35,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:30:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:30:35,759 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 11 states. [2019-11-23 21:30:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:35,970 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-11-23 21:30:35,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:30:35,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-23 21:30:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:35,974 INFO L225 Difference]: With dead ends: 84 [2019-11-23 21:30:35,974 INFO L226 Difference]: Without dead ends: 82 [2019-11-23 21:30:35,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:30:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-23 21:30:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 54. [2019-11-23 21:30:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 21:30:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2019-11-23 21:30:35,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 18 [2019-11-23 21:30:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:35,985 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2019-11-23 21:30:35,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:30:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2019-11-23 21:30:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:35,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:35,988 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:36,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:36,197 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1194608607, now seen corresponding path program 1 times [2019-11-23 21:30:36,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:36,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971036323] [2019-11-23 21:30:36,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:36,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971036323] [2019-11-23 21:30:36,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097259842] [2019-11-23 21:30:36,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:36,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-23 21:30:36,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:36,335 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:30:36,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:36,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:36,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:36,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-23 21:30:36,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:30:36,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:36,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:36,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:36,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-23 21:30:36,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:36,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:36,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-23 21:30:36,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012450777] [2019-11-23 21:30:36,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:30:36,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:36,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:30:36,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:30:36,388 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand 10 states. [2019-11-23 21:30:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:36,581 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2019-11-23 21:30:36,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:30:36,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-23 21:30:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:36,584 INFO L225 Difference]: With dead ends: 94 [2019-11-23 21:30:36,584 INFO L226 Difference]: Without dead ends: 78 [2019-11-23 21:30:36,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:30:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-23 21:30:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2019-11-23 21:30:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 21:30:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2019-11-23 21:30:36,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 18 [2019-11-23 21:30:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:36,595 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2019-11-23 21:30:36,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:30:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2019-11-23 21:30:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:36,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:36,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:36,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:36,801 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:36,802 INFO L82 PathProgramCache]: Analyzing trace with hash 385260059, now seen corresponding path program 1 times [2019-11-23 21:30:36,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:36,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867505292] [2019-11-23 21:30:36,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:30:36,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867505292] [2019-11-23 21:30:36,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:30:36,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:30:36,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847012098] [2019-11-23 21:30:36,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:30:36,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:36,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:30:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:30:36,864 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand 5 states. [2019-11-23 21:30:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:36,945 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2019-11-23 21:30:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:30:36,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-23 21:30:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:36,948 INFO L225 Difference]: With dead ends: 96 [2019-11-23 21:30:36,948 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:30:36,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:30:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:30:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-11-23 21:30:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-23 21:30:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-11-23 21:30:36,961 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 18 [2019-11-23 21:30:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:36,962 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-23 21:30:36,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:30:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2019-11-23 21:30:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 21:30:36,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:36,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:36,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash 455619718, now seen corresponding path program 2 times [2019-11-23 21:30:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323658221] [2019-11-23 21:30:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323658221] [2019-11-23 21:30:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74884310] [2019-11-23 21:30:37,151 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 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:30:37,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:30:37,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:30:37,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:30:37,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:37,211 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:30:37,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,227 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:30:37,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,238 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:30:37,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-11-23 21:30:37,287 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,288 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:30:37,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,349 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-11-23 21:30:37,354 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:30:37,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,384 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:37,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:37,424 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:30:37,424 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 1 case distinctions, treesize of input 44 treesize of output 36 [2019-11-23 21:30:37,425 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,442 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:79, output treesize:25 [2019-11-23 21:30:37,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:30:37,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,518 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:30:37,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,548 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:37,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,588 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-23 21:30:37,589 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 1 case distinctions, treesize of input 44 treesize of output 36 [2019-11-23 21:30:37,590 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:37,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:37,617 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:79, output treesize:11 [2019-11-23 21:30:37,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:37,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:37,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-23 21:30:37,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049523508] [2019-11-23 21:30:37,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:30:37,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:30:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:30:37,657 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand 11 states. [2019-11-23 21:30:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:37,959 INFO L93 Difference]: Finished difference Result 133 states and 186 transitions. [2019-11-23 21:30:37,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:30:37,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-11-23 21:30:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:37,960 INFO L225 Difference]: With dead ends: 133 [2019-11-23 21:30:37,961 INFO L226 Difference]: Without dead ends: 113 [2019-11-23 21:30:37,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:30:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-23 21:30:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 67. [2019-11-23 21:30:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-23 21:30:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2019-11-23 21:30:37,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 18 [2019-11-23 21:30:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:37,970 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2019-11-23 21:30:37,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:30:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2019-11-23 21:30:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:30:37,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:37,971 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:38,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:38,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash 625125097, now seen corresponding path program 1 times [2019-11-23 21:30:38,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:38,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128864083] [2019-11-23 21:30:38,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:38,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128864083] [2019-11-23 21:30:38,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093552911] [2019-11-23 21:30:38,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:38,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 21:30:38,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:38,535 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:30:38,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:38,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:38,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:38,615 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 36 treesize of output 17 [2019-11-23 21:30:38,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:38,652 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 36 treesize of output 17 [2019-11-23 21:30:38,652 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:38,674 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,694 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:101, output treesize:61 [2019-11-23 21:30:38,800 INFO L343 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-11-23 21:30:38,801 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 2 case distinctions, treesize of input 73 treesize of output 87 [2019-11-23 21:30:38,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,845 INFO L567 ElimStorePlain]: treesize reduction 44, result has 67.9 percent of original size [2019-11-23 21:30:38,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-11-23 21:30:38,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-11-23 21:30:38,880 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,890 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-11-23 21:30:38,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2019-11-23 21:30:38,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,923 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-11-23 21:30:38,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-11-23 21:30:38,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:38,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:38,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-11-23 21:30:38,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:38,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:38,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-23 21:30:38,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491581873] [2019-11-23 21:30:38,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:30:38,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:30:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:30:38,955 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand 11 states. [2019-11-23 21:30:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:40,340 INFO L93 Difference]: Finished difference Result 153 states and 206 transitions. [2019-11-23 21:30:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 21:30:40,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-23 21:30:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:40,343 INFO L225 Difference]: With dead ends: 153 [2019-11-23 21:30:40,343 INFO L226 Difference]: Without dead ends: 151 [2019-11-23 21:30:40,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2019-11-23 21:30:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-23 21:30:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2019-11-23 21:30:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-23 21:30:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2019-11-23 21:30:40,356 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 20 [2019-11-23 21:30:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:40,356 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2019-11-23 21:30:40,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:30:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2019-11-23 21:30:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 21:30:40,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:40,357 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:40,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:40,567 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash 625127019, now seen corresponding path program 1 times [2019-11-23 21:30:40,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:40,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931847433] [2019-11-23 21:30:40,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:40,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931847433] [2019-11-23 21:30:40,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384313647] [2019-11-23 21:30:40,801 INFO L94 rtionOrderModulation]: Keeping assertion order 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:30:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:40,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 21:30:40,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:40,855 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:30:40,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:40,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:40,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:40,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:30:40,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:40,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:30:40,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:40,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:40,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:40,928 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 36 treesize of output 17 [2019-11-23 21:30:40,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:40,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:40,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:30:40,955 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 36 treesize of output 17 [2019-11-23 21:30:40,956 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:40,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:40,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:30:40,982 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:41,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,001 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:101, output treesize:61 [2019-11-23 21:30:41,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-11-23 21:30:41,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:41,118 INFO L343 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-11-23 21:30:41,119 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 2 case distinctions, treesize of input 73 treesize of output 87 [2019-11-23 21:30:41,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,154 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.9 percent of original size [2019-11-23 21:30:41,158 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-11-23 21:30:41,159 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:41,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,174 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-11-23 21:30:41,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:41,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2019-11-23 21:30:41,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,205 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-11-23 21:30:41,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-11-23 21:30:41,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:41,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:41,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-11-23 21:30:41,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:30:41,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:41,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-23 21:30:41,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510165091] [2019-11-23 21:30:41,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:30:41,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:41,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:30:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:30:41,238 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand 11 states. [2019-11-23 21:30:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:41,897 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2019-11-23 21:30:41,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:30:41,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-23 21:30:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:41,899 INFO L225 Difference]: With dead ends: 218 [2019-11-23 21:30:41,899 INFO L226 Difference]: Without dead ends: 164 [2019-11-23 21:30:41,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-23 21:30:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-23 21:30:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2019-11-23 21:30:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-23 21:30:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2019-11-23 21:30:41,913 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 20 [2019-11-23 21:30:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:41,914 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2019-11-23 21:30:41,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:30:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2019-11-23 21:30:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:30:41,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:41,915 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:42,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:42,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -617891739, now seen corresponding path program 1 times [2019-11-23 21:30:42,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:42,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476351464] [2019-11-23 21:30:42,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:42,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476351464] [2019-11-23 21:30:42,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489969929] [2019-11-23 21:30:42,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:42,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 21:30:42,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:42,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:30:42,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:30:42,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:30:42,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:30:42,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-11-23 21:30:42,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:42,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:42,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2019-11-23 21:30:42,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633928709] [2019-11-23 21:30:42,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:30:42,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:30:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:30:42,309 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand 8 states. [2019-11-23 21:30:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:30:42,513 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2019-11-23 21:30:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:30:42,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-23 21:30:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:30:42,516 INFO L225 Difference]: With dead ends: 266 [2019-11-23 21:30:42,516 INFO L226 Difference]: Without dead ends: 198 [2019-11-23 21:30:42,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:30:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-23 21:30:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2019-11-23 21:30:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 21:30:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2019-11-23 21:30:42,541 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 22 [2019-11-23 21:30:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:30:42,542 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2019-11-23 21:30:42,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:30:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2019-11-23 21:30:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:30:42,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:30:42,552 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:30:42,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:30:42,756 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:30:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:30:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1427240287, now seen corresponding path program 1 times [2019-11-23 21:30:42,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:30:42,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804850941] [2019-11-23 21:30:42,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:30:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:42,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804850941] [2019-11-23 21:30:42,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464133840] [2019-11-23 21:30:42,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:30:42,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-23 21:30:42,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:30:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:42,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-23 21:30:42,940 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:30:42,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2019-11-23 21:30:42,951 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:30:42,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-23 21:30:42,956 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:30:42,987 INFO L567 ElimStorePlain]: treesize reduction 28, result has 53.3 percent of original size [2019-11-23 21:30:42,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-23 21:30:42,988 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:112, output treesize:32 [2019-11-23 21:30:47,833 WARN L192 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-11-23 21:30:50,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:30:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:30:50,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:30:50,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-23 21:30:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321147451] [2019-11-23 21:30:50,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:30:50,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:30:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:30:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=63, Unknown=4, NotChecked=0, Total=90 [2019-11-23 21:30:50,453 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand 10 states. [2019-11-23 21:31:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:50,769 INFO L93 Difference]: Finished difference Result 264 states and 378 transitions. [2019-11-23 21:31:50,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:31:50,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-23 21:31:50,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:50,776 INFO L225 Difference]: With dead ends: 264 [2019-11-23 21:31:50,776 INFO L226 Difference]: Without dead ends: 237 [2019-11-23 21:31:50,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=67, Invalid=131, Unknown=12, NotChecked=0, Total=210 [2019-11-23 21:31:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-23 21:31:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 146. [2019-11-23 21:31:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-23 21:31:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-23 21:31:50,792 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 22 [2019-11-23 21:31:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:50,792 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-23 21:31:50,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:31:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-23 21:31:50,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 21:31:50,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:50,796 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:50,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:50,998 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1427238365, now seen corresponding path program 1 times [2019-11-23 21:31:50,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:50,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977386171] [2019-11-23 21:31:51,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:31:51,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977386171] [2019-11-23 21:31:51,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498500744] [2019-11-23 21:31:51,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:31:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:51,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-23 21:31:51,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:51,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:51,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:51,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:51,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-11-23 21:31:51,213 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:31:51,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-11-23 21:31:51,221 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:31:51,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2019-11-23 21:31:51,226 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:51,260 INFO L567 ElimStorePlain]: treesize reduction 36, result has 47.8 percent of original size [2019-11-23 21:31:51,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-23 21:31:51,262 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:133, output treesize:33 [2019-11-23 21:31:51,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:31:51,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:51,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 21:31:51,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781636686] [2019-11-23 21:31:51,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:31:51,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:51,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:31:51,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:31:51,328 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 13 states. [2019-11-23 21:31:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:51,883 INFO L93 Difference]: Finished difference Result 383 states and 566 transitions. [2019-11-23 21:31:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:31:51,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-23 21:31:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:51,885 INFO L225 Difference]: With dead ends: 383 [2019-11-23 21:31:51,885 INFO L226 Difference]: Without dead ends: 316 [2019-11-23 21:31:51,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:31:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-23 21:31:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 190. [2019-11-23 21:31:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-23 21:31:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 279 transitions. [2019-11-23 21:31:51,897 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 279 transitions. Word has length 22 [2019-11-23 21:31:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:51,898 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 279 transitions. [2019-11-23 21:31:51,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:31:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 279 transitions. [2019-11-23 21:31:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:31:51,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:51,899 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:52,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:52,102 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1725952529, now seen corresponding path program 2 times [2019-11-23 21:31:52,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:52,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467765811] [2019-11-23 21:31:52,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:52,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467765811] [2019-11-23 21:31:52,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392173192] [2019-11-23 21:31:52,486 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:52,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:31:52,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:52,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 21:31:52,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:52,559 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:31:52,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:52,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,603 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:31:52,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,703 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.5 percent of original size [2019-11-23 21:31:52,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:52,715 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 36 treesize of output 17 [2019-11-23 21:31:52,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:52,759 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 36 treesize of output 17 [2019-11-23 21:31:52,760 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:52,792 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:52,818 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:110, output treesize:69 [2019-11-23 21:31:52,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:52,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:52,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:53,013 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-23 21:31:53,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:53,015 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_40|, |v_#memory_int_41|, |v_#memory_int_42|], 14=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|]} [2019-11-23 21:31:53,018 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:31:53,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:53,117 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:53,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:53,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:53,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:53,199 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 68 treesize of output 48 [2019-11-23 21:31:53,200 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:53,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:53,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:53,482 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-23 21:31:53,482 INFO L343 Elim1Store]: treesize reduction 132, result has 58.9 percent of original size [2019-11-23 21:31:53,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 191 treesize of output 285 [2019-11-23 21:31:53,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:53,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:53,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:53,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:53,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,496 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:53,849 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-11-23 21:31:53,850 INFO L567 ElimStorePlain]: treesize reduction 3593, result has 5.2 percent of original size [2019-11-23 21:31:53,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:53,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:53,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 108 [2019-11-23 21:31:53,873 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:53,976 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-23 21:31:53,977 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.5 percent of original size [2019-11-23 21:31:53,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:53,981 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:260, output treesize:182 [2019-11-23 21:31:53,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:53,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,262 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_43|], 30=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|]} [2019-11-23 21:31:54,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:54,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 183 [2019-11-23 21:31:54,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:54,280 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 200 [2019-11-23 21:31:54,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:54,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:54,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:54,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 179 [2019-11-23 21:31:54,403 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:54,459 INFO L343 Elim1Store]: treesize reduction 20, result has 68.8 percent of original size [2019-11-23 21:31:54,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 176 [2019-11-23 21:31:54,462 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:54,609 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-23 21:31:54,610 INFO L567 ElimStorePlain]: treesize reduction 190, result has 63.5 percent of original size [2019-11-23 21:31:54,740 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-23 21:31:54,741 INFO L343 Elim1Store]: treesize reduction 52, result has 63.6 percent of original size [2019-11-23 21:31:54,741 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 5 case distinctions, treesize of input 156 treesize of output 167 [2019-11-23 21:31:54,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,754 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:54,950 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-23 21:31:54,951 INFO L343 Elim1Store]: treesize reduction 76, result has 67.0 percent of original size [2019-11-23 21:31:54,951 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 173 treesize of output 245 [2019-11-23 21:31:54,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:54,963 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:55,145 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2019-11-23 21:31:55,145 INFO L567 ElimStorePlain]: treesize reduction 312, result has 42.9 percent of original size [2019-11-23 21:31:55,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-23 21:31:55,147 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:394, output treesize:300 [2019-11-23 21:31:55,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,155 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 12=[v_prenex_2, v_prenex_3]} [2019-11-23 21:31:55,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:55,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 125 [2019-11-23 21:31:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,198 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:31:55,300 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-11-23 21:31:55,301 INFO L567 ElimStorePlain]: treesize reduction 72, result has 75.3 percent of original size [2019-11-23 21:31:55,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2019-11-23 21:31:55,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:55,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:55,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:55,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 184 [2019-11-23 21:31:55,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:31:55,419 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:31:55,499 INFO L567 ElimStorePlain]: treesize reduction 74, result has 58.2 percent of original size [2019-11-23 21:31:55,513 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:55,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 64 [2019-11-23 21:31:55,514 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:55,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:55,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:55,544 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:322, output treesize:7 [2019-11-23 21:31:55,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:31:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:55,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:31:55,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-11-23 21:31:55,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414652657] [2019-11-23 21:31:55,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:31:55,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:31:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:31:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:31:55,559 INFO L87 Difference]: Start difference. First operand 190 states and 279 transitions. Second operand 13 states. [2019-11-23 21:31:55,779 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-23 21:31:56,400 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-11-23 21:31:57,529 WARN L192 SmtUtils]: Spent 945.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-23 21:31:58,151 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-23 21:31:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:31:58,869 INFO L93 Difference]: Finished difference Result 293 states and 416 transitions. [2019-11-23 21:31:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 21:31:58,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-23 21:31:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:31:58,872 INFO L225 Difference]: With dead ends: 293 [2019-11-23 21:31:58,872 INFO L226 Difference]: Without dead ends: 291 [2019-11-23 21:31:58,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:31:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-23 21:31:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 225. [2019-11-23 21:31:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-23 21:31:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-11-23 21:31:58,887 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 24 [2019-11-23 21:31:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:31:58,888 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-11-23 21:31:58,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:31:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-11-23 21:31:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 21:31:58,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:31:58,889 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:31:59,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:59,110 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:31:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:31:59,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1725950607, now seen corresponding path program 2 times [2019-11-23 21:31:59,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:31:59,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579153914] [2019-11-23 21:31:59,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:31:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:31:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:31:59,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579153914] [2019-11-23 21:31:59,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491597195] [2019-11-23 21:31:59,377 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:31:59,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:31:59,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:31:59,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 21:31:59,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:31:59,438 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:31:59,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-23 21:31:59,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,474 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:31:59,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,577 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-23 21:31:59,578 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.5 percent of original size [2019-11-23 21:31:59,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:59,595 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 36 treesize of output 17 [2019-11-23 21:31:59,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:31:59,635 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:31:59,679 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 36 treesize of output 17 [2019-11-23 21:31:59,679 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,706 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:110, output treesize:69 [2019-11-23 21:31:59,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:31:59,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:31:59,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:31:59,857 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_45|, |v_#memory_int_46|, |v_#memory_int_47|], 14=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_23|]} [2019-11-23 21:31:59,882 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:32:00,024 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-23 21:32:00,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:32:00,032 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:32:00,158 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-23 21:32:00,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:32:00,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:32:00,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:32:00,173 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 68 treesize of output 48 [2019-11-23 21:32:00,174 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:32:00,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:32:00,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:32:00,537 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-23 21:32:00,538 INFO L343 Elim1Store]: treesize reduction 132, result has 58.9 percent of original size [2019-11-23 21:32:00,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 191 treesize of output 285 [2019-11-23 21:32:00,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:32:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:00,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:00,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:00,551 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:32:00,910 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 66 [2019-11-23 21:32:00,910 INFO L567 ElimStorePlain]: treesize reduction 2457, result has 11.9 percent of original size [2019-11-23 21:32:00,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:32:01,156 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-23 21:32:01,157 INFO L343 Elim1Store]: treesize reduction 66, result has 79.7 percent of original size [2019-11-23 21:32:01,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 299 treesize of output 428 [2019-11-23 21:32:01,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:32:01,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:32:01,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:32:01,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:01,889 INFO L496 ElimStorePlain]: Start of recursive call 7: 27 dim-0 vars, End of recursive call: 27 dim-0 vars, and 21 xjuncts. [2019-11-23 21:32:12,045 WARN L192 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 989 DAG size of output: 403 [2019-11-23 21:32:12,047 INFO L567 ElimStorePlain]: treesize reduction 267038, result has 1.6 percent of original size [2019-11-23 21:32:12,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 18 terms [2019-11-23 21:32:12,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-23 21:32:12,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 26 dim-0 vars, and 1 xjuncts. [2019-11-23 21:32:12,100 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:260, output treesize:5789 [2019-11-23 21:32:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:32:12,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms