./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_flag-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash afc88cbf4886a453fed887733400308a528b9724 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:33:24,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:33:24,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:33:24,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:33:24,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:33:24,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:33:24,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:33:24,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:33:24,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:33:24,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:33:24,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:33:24,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:33:24,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:33:24,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:33:24,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:33:24,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:33:24,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:33:24,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:33:24,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:33:24,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:33:24,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:33:24,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:33:24,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:33:24,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:33:24,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:33:24,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:33:24,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:33:24,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:33:24,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:33:24,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:33:24,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:33:24,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:33:24,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:33:24,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:33:24,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:33:24,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:33:24,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:33:24,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:33:24,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:33:24,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:33:24,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:33:24,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:33:24,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:33:24,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:33:24,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:33:24,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:33:24,132 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:33:24,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:33:24,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:33:24,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:33:24,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:33:24,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:33:24,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:33:24,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:33:24,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:33:24,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:33:24,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:33:24,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:33:24,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:33:24,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:33:24,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:33:24,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:33:24,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:33:24,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:33:24,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:33:24,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:33:24,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:33:24,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:33:24,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:33:24,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:33:24,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> afc88cbf4886a453fed887733400308a528b9724 [2019-11-19 22:33:24,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:33:24,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:33:24,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:33:24,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:33:24,384 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:33:24,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/../../sv-benchmarks/c/list-properties/list_flag-2.i [2019-11-19 22:33:24,488 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/data/1200d57d1/50547502a42a42b280af5ec0caaff2e9/FLAGb5e7eaa8f [2019-11-19 22:33:25,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:33:25,143 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/sv-benchmarks/c/list-properties/list_flag-2.i [2019-11-19 22:33:25,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/data/1200d57d1/50547502a42a42b280af5ec0caaff2e9/FLAGb5e7eaa8f [2019-11-19 22:33:25,374 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/data/1200d57d1/50547502a42a42b280af5ec0caaff2e9 [2019-11-19 22:33:25,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:33:25,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:33:25,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:33:25,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:33:25,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:33:25,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:33:25" (1/1) ... [2019-11-19 22:33:25,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9b0651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:25, skipping insertion in model container [2019-11-19 22:33:25,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:33:25" (1/1) ... [2019-11-19 22:33:25,406 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:33:25,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:33:26,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:33:26,020 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:33:26,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:33:26,227 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:33:26,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26 WrapperNode [2019-11-19 22:33:26,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:33:26,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:33:26,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:33:26,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:33:26,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:33:26,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:33:26,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:33:26,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:33:26,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... [2019-11-19 22:33:26,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:33:26,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:33:26,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:33:26,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:33:26,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:33:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:33:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:33:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:33:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:33:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:33:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:33:26,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:33:26,852 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:33:26,852 INFO L285 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-19 22:33:26,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:33:26 BoogieIcfgContainer [2019-11-19 22:33:26,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:33:26,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:33:26,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:33:26,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:33:26,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:33:25" (1/3) ... [2019-11-19 22:33:26,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:33:26, skipping insertion in model container [2019-11-19 22:33:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:33:26" (2/3) ... [2019-11-19 22:33:26,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:33:26, skipping insertion in model container [2019-11-19 22:33:26,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:33:26" (3/3) ... [2019-11-19 22:33:26,864 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2019-11-19 22:33:26,877 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:33:26,887 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:33:26,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:33:26,930 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:33:26,930 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:33:26,930 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:33:26,930 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:33:26,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:33:26,931 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:33:26,931 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:33:26,931 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:33:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-19 22:33:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:33:26,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:26,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:26,954 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1941242346, now seen corresponding path program 1 times [2019-11-19 22:33:26,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:26,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271608353] [2019-11-19 22:33:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:27,116 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-19 22:33:27,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271608353] [2019-11-19 22:33:27,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:27,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 22:33:27,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484410095] [2019-11-19 22:33:27,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:33:27,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:33:27,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:33:27,147 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-11-19 22:33:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:27,168 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2019-11-19 22:33:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:33:27,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 22:33:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:27,182 INFO L225 Difference]: With dead ends: 38 [2019-11-19 22:33:27,183 INFO L226 Difference]: Without dead ends: 20 [2019-11-19 22:33:27,187 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-19 22:33:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-19 22:33:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 22:33:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 22:33:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-11-19 22:33:27,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2019-11-19 22:33:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:27,231 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-11-19 22:33:27,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:33:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-11-19 22:33:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 22:33:27,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:27,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:27,234 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1795403316, now seen corresponding path program 1 times [2019-11-19 22:33:27,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:27,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046323619] [2019-11-19 22:33:27,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:27,398 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-19 22:33:27,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046323619] [2019-11-19 22:33:27,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:27,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:33:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644703583] [2019-11-19 22:33:27,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:33:27,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:33:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:33:27,403 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 5 states. [2019-11-19 22:33:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:27,584 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-11-19 22:33:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:33:27,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-19 22:33:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:27,587 INFO L225 Difference]: With dead ends: 44 [2019-11-19 22:33:27,587 INFO L226 Difference]: Without dead ends: 40 [2019-11-19 22:33:27,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:33:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-19 22:33:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-19 22:33:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 22:33:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-19 22:33:27,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2019-11-19 22:33:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:27,599 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-19 22:33:27,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:33:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-19 22:33:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:33:27,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:27,601 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:27,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1242942375, now seen corresponding path program 1 times [2019-11-19 22:33:27,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:27,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238946641] [2019-11-19 22:33:27,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:27,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238946641] [2019-11-19 22:33:27,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:27,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:33:27,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559907824] [2019-11-19 22:33:27,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:33:27,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:27,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:33:27,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:33:27,712 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2019-11-19 22:33:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:27,873 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-11-19 22:33:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:33:27,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-19 22:33:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:27,877 INFO L225 Difference]: With dead ends: 46 [2019-11-19 22:33:27,877 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 22:33:27,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:33:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 22:33:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-11-19 22:33:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 22:33:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-11-19 22:33:27,884 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2019-11-19 22:33:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:27,884 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-11-19 22:33:27,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:33:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-11-19 22:33:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:33:27,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:27,886 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:27,886 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -799146, now seen corresponding path program 1 times [2019-11-19 22:33:27,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:27,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821270410] [2019-11-19 22:33:27,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:27,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821270410] [2019-11-19 22:33:27,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:27,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:33:27,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340589471] [2019-11-19 22:33:27,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:33:27,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:27,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:33:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:33:27,987 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 5 states. [2019-11-19 22:33:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:28,111 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-11-19 22:33:28,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:33:28,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-19 22:33:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:28,113 INFO L225 Difference]: With dead ends: 44 [2019-11-19 22:33:28,113 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 22:33:28,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:33:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 22:33:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2019-11-19 22:33:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-19 22:33:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-19 22:33:28,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2019-11-19 22:33:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:28,119 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-19 22:33:28,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:33:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-19 22:33:28,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:33:28,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:28,121 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:28,121 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:28,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash -172690303, now seen corresponding path program 1 times [2019-11-19 22:33:28,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:28,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860996021] [2019-11-19 22:33:28,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:28,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860996021] [2019-11-19 22:33:28,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:28,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:33:28,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179948923] [2019-11-19 22:33:28,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:33:28,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:33:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:28,184 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2019-11-19 22:33:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:28,208 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-11-19 22:33:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:33:28,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:33:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:28,212 INFO L225 Difference]: With dead ends: 50 [2019-11-19 22:33:28,212 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 22:33:28,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 22:33:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-19 22:33:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-19 22:33:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-19 22:33:28,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2019-11-19 22:33:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:28,226 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-19 22:33:28,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:33:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-19 22:33:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:33:28,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:28,229 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:28,229 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash -616427248, now seen corresponding path program 1 times [2019-11-19 22:33:28,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:28,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436846313] [2019-11-19 22:33:28,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436846313] [2019-11-19 22:33:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205009310] [2019-11-19 22:33:28,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:28,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 22:33:28,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:28,608 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-19 22:33:28,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:33:28,647 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-19 22:33:28,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-19 22:33:28,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,685 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-19 22:33:28,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-19 22:33:28,741 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-19 22:33:28,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-19 22:33:28,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-19 22:33:28,792 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 19 treesize of output 18 [2019-11-19 22:33:28,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:28,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-19 22:33:28,885 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:28,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:28,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:28,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-19 22:33:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:28,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:28,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-19 22:33:28,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558224251] [2019-11-19 22:33:28,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:33:28,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:33:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:33:28,902 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 11 states. [2019-11-19 22:33:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:29,395 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-11-19 22:33:29,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:33:29,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-19 22:33:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:29,400 INFO L225 Difference]: With dead ends: 59 [2019-11-19 22:33:29,400 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 22:33:29,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:33:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 22:33:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2019-11-19 22:33:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 22:33:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2019-11-19 22:33:29,413 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2019-11-19 22:33:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:29,413 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2019-11-19 22:33:29,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:33:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2019-11-19 22:33:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:33:29,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:29,415 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:29,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:29,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash -759496317, now seen corresponding path program 1 times [2019-11-19 22:33:29,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935194981] [2019-11-19 22:33:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:29,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935194981] [2019-11-19 22:33:29,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062210769] [2019-11-19 22:33:29,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:29,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 22:33:29,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:29,937 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-19 22:33:29,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:29,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:29,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:29,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:33:29,976 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-19 22:33:29,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:29,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:29,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:29,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-19 22:33:30,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:30,010 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-19 22:33:30,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:30,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-19 22:33:30,059 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-19 22:33:30,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-19 22:33:30,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:30,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-19 22:33:30,117 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 19 treesize of output 18 [2019-11-19 22:33:30,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:30,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:30,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-19 22:33:30,175 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:30,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:30,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:30,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-19 22:33:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:30,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:30,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-11-19 22:33:30,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888481055] [2019-11-19 22:33:30,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:33:30,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:30,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:33:30,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:33:30,189 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 11 states. [2019-11-19 22:33:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:30,605 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-19 22:33:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:33:30,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-19 22:33:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:30,609 INFO L225 Difference]: With dead ends: 74 [2019-11-19 22:33:30,609 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 22:33:30,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:33:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 22:33:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-11-19 22:33:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 22:33:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-11-19 22:33:30,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 19 [2019-11-19 22:33:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:30,620 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-11-19 22:33:30,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:33:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-11-19 22:33:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 22:33:30,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:30,621 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:30,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:30,826 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1203233262, now seen corresponding path program 1 times [2019-11-19 22:33:30,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:30,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745808693] [2019-11-19 22:33:30,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:30,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745808693] [2019-11-19 22:33:30,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:33:30,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:33:30,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516308591] [2019-11-19 22:33:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:33:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:33:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:30,867 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 3 states. [2019-11-19 22:33:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:30,883 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-11-19 22:33:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:33:30,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 22:33:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:30,886 INFO L225 Difference]: With dead ends: 67 [2019-11-19 22:33:30,887 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 22:33:30,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:33:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 22:33:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-19 22:33:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-19 22:33:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-19 22:33:30,904 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 19 [2019-11-19 22:33:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:30,904 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-19 22:33:30,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:33:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-19 22:33:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:33:30,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:30,905 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:30,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:30,906 INFO L82 PathProgramCache]: Analyzing trace with hash 353277899, now seen corresponding path program 1 times [2019-11-19 22:33:30,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:30,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413276452] [2019-11-19 22:33:30,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:31,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413276452] [2019-11-19 22:33:31,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532716762] [2019-11-19 22:33:31,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:31,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-19 22:33:31,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:31,171 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-19 22:33:31,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:33:31,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,230 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-19 22:33:31,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-19 22:33:31,296 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 13 treesize of output 9 [2019-11-19 22:33:31,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,331 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 13 treesize of output 9 [2019-11-19 22:33:31,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-19 22:33:31,404 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_18|], 2=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_12|]} [2019-11-19 22:33:31,411 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 29 treesize of output 19 [2019-11-19 22:33:31,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,470 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-19 22:33:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:31,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,501 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-19 22:33:31,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-19 22:33:31,506 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,514 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-19 22:33:31,567 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 39 treesize of output 21 [2019-11-19 22:33:31,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-19 22:33:31,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-19 22:33:31,612 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-19 22:33:31,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:31,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:31,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:33:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:31,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:31,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-19 22:33:31,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844940513] [2019-11-19 22:33:31,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:33:31,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:33:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:33:31,627 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 14 states. [2019-11-19 22:33:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:32,103 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-11-19 22:33:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:33:32,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-19 22:33:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:32,105 INFO L225 Difference]: With dead ends: 73 [2019-11-19 22:33:32,105 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 22:33:32,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:33:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 22:33:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-11-19 22:33:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 22:33:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-19 22:33:32,124 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 21 [2019-11-19 22:33:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:32,127 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-19 22:33:32,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:33:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-19 22:33:32,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:33:32,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:32,130 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:32,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:32,341 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 232020934, now seen corresponding path program 2 times [2019-11-19 22:33:32,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:32,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255900508] [2019-11-19 22:33:32,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:32,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255900508] [2019-11-19 22:33:32,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911180956] [2019-11-19 22:33:32,535 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:32,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:32,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:32,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 22:33:32,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:32,639 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-19 22:33:32,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:32,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,669 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-19 22:33:32,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-19 22:33:32,693 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-19 22:33:32,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,714 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-19 22:33:32,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-19 22:33:32,748 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-19 22:33:32,757 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 23 treesize of output 15 [2019-11-19 22:33:32,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,795 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-19 22:33:32,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:32,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,829 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2019-11-19 22:33:32,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-11-19 22:33:32,834 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,851 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-19 22:33:32,893 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 31 treesize of output 19 [2019-11-19 22:33:32,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-19 22:33:32,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,928 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-19 22:33:32,928 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-19 22:33:32,934 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-19 22:33:32,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:32,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:32,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:33:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:32,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:32,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 22:33:32,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719725609] [2019-11-19 22:33:32,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:33:32,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:32,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:33:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:33:32,943 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2019-11-19 22:33:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:33,300 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-19 22:33:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:33:33,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-19 22:33:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:33,301 INFO L225 Difference]: With dead ends: 75 [2019-11-19 22:33:33,302 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 22:33:33,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:33:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 22:33:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2019-11-19 22:33:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 22:33:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-11-19 22:33:33,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2019-11-19 22:33:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:33,309 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-11-19 22:33:33,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:33:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-11-19 22:33:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:33:33,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:33,311 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:33,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:33,512 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -107333895, now seen corresponding path program 1 times [2019-11-19 22:33:33,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:33,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683549246] [2019-11-19 22:33:33,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:33,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683549246] [2019-11-19 22:33:33,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118904303] [2019-11-19 22:33:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:33,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-19 22:33:33,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:33,800 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-19 22:33:33,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:33,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:33:33,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:33,868 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-19 22:33:33,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:33,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-19 22:33:33,931 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 13 treesize of output 9 [2019-11-19 22:33:33,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:33,962 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 13 treesize of output 9 [2019-11-19 22:33:33,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:33,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:33,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-19 22:33:34,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-19 22:33:34,051 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 29 treesize of output 19 [2019-11-19 22:33:34,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,116 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-19 22:33:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:34,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-19 22:33:34,168 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-19 22:33:34,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-19 22:33:34,175 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,183 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-19 22:33:34,225 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 39 treesize of output 21 [2019-11-19 22:33:34,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-19 22:33:34,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-19 22:33:34,258 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-19 22:33:34,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:34,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:34,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:33:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:34,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-19 22:33:34,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973972948] [2019-11-19 22:33:34,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:33:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:33:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:33:34,266 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 14 states. [2019-11-19 22:33:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:34,597 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-19 22:33:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:33:34,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-11-19 22:33:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:34,598 INFO L225 Difference]: With dead ends: 69 [2019-11-19 22:33:34,598 INFO L226 Difference]: Without dead ends: 57 [2019-11-19 22:33:34,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:33:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-19 22:33:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-11-19 22:33:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 22:33:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-19 22:33:34,605 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 23 [2019-11-19 22:33:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:34,605 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-19 22:33:34,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:33:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-19 22:33:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:33:34,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:34,606 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:34,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:34,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:34,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:34,811 INFO L82 PathProgramCache]: Analyzing trace with hash -364832763, now seen corresponding path program 2 times [2019-11-19 22:33:34,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:34,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950769184] [2019-11-19 22:33:34,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:35,092 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-19 22:33:35,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950769184] [2019-11-19 22:33:35,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615148308] [2019-11-19 22:33:35,094 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:35,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:35,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:35,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-19 22:33:35,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:35,179 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-19 22:33:35,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:35,206 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-19 22:33:35,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 22:33:35,244 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,244 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-19 22:33:35,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-19 22:33:35,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:35,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-19 22:33:35,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-19 22:33:35,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:35,356 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 19 treesize of output 18 [2019-11-19 22:33:35,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-11-19 22:33:35,441 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-19 22:33:35,442 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-19 22:33:35,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:35,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-19 22:33:35,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:35,565 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-19 22:33:35,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:35,624 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-19 22:33:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:35,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-19 22:33:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:36,032 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:36,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:36,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:36,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:36,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-19 22:33:36,050 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-19 22:33:36,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:36,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 19 [2019-11-19 22:33:36,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117417192] [2019-11-19 22:33:36,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:33:36,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:33:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:33:36,054 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 19 states. [2019-11-19 22:33:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:37,103 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-19 22:33:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:33:37,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-11-19 22:33:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:37,105 INFO L225 Difference]: With dead ends: 85 [2019-11-19 22:33:37,105 INFO L226 Difference]: Without dead ends: 79 [2019-11-19 22:33:37,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 22:33:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-19 22:33:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2019-11-19 22:33:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-19 22:33:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-11-19 22:33:37,121 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 25 [2019-11-19 22:33:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:37,122 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-11-19 22:33:37,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:33:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-11-19 22:33:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:33:37,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:37,125 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:37,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:37,335 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2098121722, now seen corresponding path program 2 times [2019-11-19 22:33:37,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:37,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359572272] [2019-11-19 22:33:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:37,633 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-19 22:33:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359572272] [2019-11-19 22:33:37,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238244842] [2019-11-19 22:33:37,633 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:37,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:37,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:37,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-19 22:33:37,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:37,720 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-19 22:33:37,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:37,739 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-19 22:33:37,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 22:33:37,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,759 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-19 22:33:37,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-19 22:33:37,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:37,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-19 22:33:37,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-19 22:33:37,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:37,820 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 19 treesize of output 18 [2019-11-19 22:33:37,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-11-19 22:33:37,893 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-19 22:33:37,893 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-19 22:33:37,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:37,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:37,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-19 22:33:37,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:37,993 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-19 22:33:37,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:38,035 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-19 22:33:38,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:38,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-19 22:33:38,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:38,279 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:38,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:38,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:38,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:38,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-19 22:33:38,288 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-19 22:33:38,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:38,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 19 [2019-11-19 22:33:38,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382388612] [2019-11-19 22:33:38,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:33:38,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:33:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:33:38,291 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 19 states. [2019-11-19 22:33:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:39,495 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-11-19 22:33:39,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:33:39,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-11-19 22:33:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:39,496 INFO L225 Difference]: With dead ends: 101 [2019-11-19 22:33:39,496 INFO L226 Difference]: Without dead ends: 95 [2019-11-19 22:33:39,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 22:33:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-19 22:33:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2019-11-19 22:33:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 22:33:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-11-19 22:33:39,506 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 25 [2019-11-19 22:33:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:39,506 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-11-19 22:33:39,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:33:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-11-19 22:33:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:33:39,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:39,508 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:39,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:39,713 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1617409408, now seen corresponding path program 3 times [2019-11-19 22:33:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:39,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167139130] [2019-11-19 22:33:39,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:40,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167139130] [2019-11-19 22:33:40,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979607557] [2019-11-19 22:33:40,089 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:40,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-19 22:33:40,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:40,160 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-19 22:33:40,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:40,172 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-19 22:33:40,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:40,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,224 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-19 22:33:40,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,255 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-19 22:33:40,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-19 22:33:40,295 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-19 22:33:40,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,324 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-19 22:33:40,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,351 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-19 22:33:40,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-19 22:33:40,407 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|]} [2019-11-19 22:33:40,416 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-19 22:33:40,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:40,468 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 40 treesize of output 20 [2019-11-19 22:33:40,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,504 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 30 treesize of output 14 [2019-11-19 22:33:40,504 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,522 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:42 [2019-11-19 22:33:40,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,579 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-19 22:33:40,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2019-11-19 22:33:40,657 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 1=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|]} [2019-11-19 22:33:40,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-19 22:33:40,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2019-11-19 22:33:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:40,732 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,830 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.2 percent of original size [2019-11-19 22:33:40,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:40,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-19 22:33:40,843 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:40,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:40,876 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-11-19 22:33:40,949 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 5=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_22|]} [2019-11-19 22:33:40,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-19 22:33:40,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:41,045 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-19 22:33:41,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:41,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-11-19 22:33:41,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:41,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:41,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:41,203 INFO L567 ElimStorePlain]: treesize reduction 303, result has 29.0 percent of original size [2019-11-19 22:33:41,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:41,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:41,239 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 1 case distinctions, treesize of input 109 treesize of output 146 [2019-11-19 22:33:41,239 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:41,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:41,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:41,256 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-19 22:33:41,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:41,350 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 57 treesize of output 40 [2019-11-19 22:33:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:41,353 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-19 22:33:41,410 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-19 22:33:41,418 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:41,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:41,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:41,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:41,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-19 22:33:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:41,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:41,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-19 22:33:41,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791308345] [2019-11-19 22:33:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:33:41,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:33:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:33:41,572 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 22 states. [2019-11-19 22:33:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:42,238 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-11-19 22:33:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:33:42,240 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-11-19 22:33:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:42,241 INFO L225 Difference]: With dead ends: 91 [2019-11-19 22:33:42,241 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 22:33:42,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2019-11-19 22:33:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 22:33:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-11-19 22:33:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:33:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2019-11-19 22:33:42,251 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 27 [2019-11-19 22:33:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:42,252 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2019-11-19 22:33:42,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:33:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2019-11-19 22:33:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:33:42,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:42,254 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:42,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:42,458 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:42,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2003989077, now seen corresponding path program 2 times [2019-11-19 22:33:42,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:42,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138980729] [2019-11-19 22:33:42,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:42,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138980729] [2019-11-19 22:33:42,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380377610] [2019-11-19 22:33:42,897 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:42,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:33:42,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:42,982 WARN L253 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-19 22:33:42,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:42,992 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-19 22:33:42,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:42,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:42,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:43,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,042 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-19 22:33:43,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,098 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-19 22:33:43,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-19 22:33:43,169 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-19 22:33:43,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,205 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-19 22:33:43,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,235 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-19 22:33:43,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-19 22:33:43,306 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_24|]} [2019-11-19 22:33:43,314 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-19 22:33:43,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:43,374 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 40 treesize of output 20 [2019-11-19 22:33:43,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:43,451 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 30 treesize of output 14 [2019-11-19 22:33:43,452 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,475 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:50 [2019-11-19 22:33:43,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,558 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-19 22:33:43,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:51 [2019-11-19 22:33:43,625 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 1=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_25|]} [2019-11-19 22:33:43,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-19 22:33:43,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 74 [2019-11-19 22:33:43,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,735 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.2 percent of original size [2019-11-19 22:33:43,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:43,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-19 22:33:43,744 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,765 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-11-19 22:33:43,817 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_36|], 5=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_26|]} [2019-11-19 22:33:43,826 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-19 22:33:43,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:43,872 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-19 22:33:43,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:43,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-11-19 22:33:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:43,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:43,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:43,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2019-11-19 22:33:44,078 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-11-19 22:33:44,079 INFO L567 ElimStorePlain]: treesize reduction 1778, result has 6.5 percent of original size [2019-11-19 22:33:44,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:44,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:44,104 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 1 case distinctions, treesize of input 120 treesize of output 157 [2019-11-19 22:33:44,105 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:44,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:44,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:44,128 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-19 22:33:44,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:44,190 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 57 treesize of output 40 [2019-11-19 22:33:44,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:44,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:44,192 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-19 22:33:44,222 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-11-19 22:33:44,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:33:44,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:44,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:44,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:44,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:18 [2019-11-19 22:33:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:44,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:44,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-19 22:33:44,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029552314] [2019-11-19 22:33:44,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:33:44,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:33:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:33:44,340 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 21 states. [2019-11-19 22:33:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:45,187 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2019-11-19 22:33:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 22:33:45,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-11-19 22:33:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:45,188 INFO L225 Difference]: With dead ends: 97 [2019-11-19 22:33:45,189 INFO L226 Difference]: Without dead ends: 93 [2019-11-19 22:33:45,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2019-11-19 22:33:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-19 22:33:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-11-19 22:33:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-19 22:33:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-11-19 22:33:45,198 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2019-11-19 22:33:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:45,199 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-11-19 22:33:45,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:33:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-11-19 22:33:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:33:45,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:45,201 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:45,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:45,405 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -413343685, now seen corresponding path program 4 times [2019-11-19 22:33:45,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:45,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148040372] [2019-11-19 22:33:45,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:46,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148040372] [2019-11-19 22:33:46,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186102882] [2019-11-19 22:33:46,015 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:46,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:33:46,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:46,178 WARN L253 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-19 22:33:46,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:46,194 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-19 22:33:46,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:46,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,230 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-19 22:33:46,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-19 22:33:46,300 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-19 22:33:46,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,330 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-19 22:33:46,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,350 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-19 22:33:46,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-11-19 22:33:46,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:46,417 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 30 treesize of output 14 [2019-11-19 22:33:46,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:46,452 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 31 treesize of output 15 [2019-11-19 22:33:46,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:29 [2019-11-19 22:33:46,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 74 [2019-11-19 22:33:46,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,622 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2019-11-19 22:33:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,655 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2019-11-19 22:33:46,656 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-19 22:33:46,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:52 [2019-11-19 22:33:46,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 5=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|]} [2019-11-19 22:33:46,706 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 35 treesize of output 23 [2019-11-19 22:33:46,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:46,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:46,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 160 [2019-11-19 22:33:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:46,801 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-11-19 22:33:46,938 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 33 [2019-11-19 22:33:46,938 INFO L567 ElimStorePlain]: treesize reduction 645, result has 14.5 percent of original size [2019-11-19 22:33:47,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,011 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 105 treesize of output 194 [2019-11-19 22:33:47,012 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:47,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:47,036 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:175, output treesize:45 [2019-11-19 22:33:47,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:33:47,276 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-19 22:33:47,277 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 60 [2019-11-19 22:33:47,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:47,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:47,280 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-19 22:33:47,337 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.7 percent of original size [2019-11-19 22:33:47,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2019-11-19 22:33:47,357 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:47,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:47,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:29 [2019-11-19 22:33:47,464 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 29 [2019-11-19 22:33:47,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:47,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:47,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:47,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-19 22:33:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:47,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:47,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-11-19 22:33:47,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803871171] [2019-11-19 22:33:47,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:33:47,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:47,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:33:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:33:47,493 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 22 states. [2019-11-19 22:33:48,754 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-19 22:33:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:49,083 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-11-19 22:33:49,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:33:49,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-11-19 22:33:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:49,084 INFO L225 Difference]: With dead ends: 111 [2019-11-19 22:33:49,084 INFO L226 Difference]: Without dead ends: 105 [2019-11-19 22:33:49,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 22:33:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-19 22:33:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-11-19 22:33:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:33:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-11-19 22:33:49,097 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 29 [2019-11-19 22:33:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:49,097 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-11-19 22:33:49,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:33:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-11-19 22:33:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:33:49,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:49,100 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:49,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:49,304 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2051913674, now seen corresponding path program 5 times [2019-11-19 22:33:49,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:49,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468111815] [2019-11-19 22:33:49,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:49,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468111815] [2019-11-19 22:33:49,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902830079] [2019-11-19 22:33:49,817 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:49,900 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-19 22:33:49,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:49,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-19 22:33:49,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:49,914 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-19 22:33:49,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:49,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:49,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:49,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:33:49,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:49,980 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-19 22:33:49,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,039 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-19 22:33:50,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-19 22:33:50,081 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 13 treesize of output 9 [2019-11-19 22:33:50,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,110 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 13 treesize of output 9 [2019-11-19 22:33:50,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,125 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-19 22:33:50,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-19 22:33:50,219 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-19 22:33:50,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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-19 22:33:50,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,272 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.1 percent of original size [2019-11-19 22:33:50,277 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 34 treesize of output 16 [2019-11-19 22:33:50,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:42 [2019-11-19 22:33:50,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,339 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 22 treesize of output 32 [2019-11-19 22:33:50,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:52 [2019-11-19 22:33:50,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 131 [2019-11-19 22:33:50,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:50,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:50,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 22:33:50,510 INFO L567 ElimStorePlain]: treesize reduction 130, result has 49.8 percent of original size [2019-11-19 22:33:50,515 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 96 [2019-11-19 22:33:50,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:80 [2019-11-19 22:33:50,665 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_38|], 6=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_34|]} [2019-11-19 22:33:50,672 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 41 treesize of output 27 [2019-11-19 22:33:50,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 175 [2019-11-19 22:33:50,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:50,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:50,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,842 INFO L567 ElimStorePlain]: treesize reduction 172, result has 45.9 percent of original size [2019-11-19 22:33:50,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 77 [2019-11-19 22:33:50,848 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:50,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:50,865 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:225, output treesize:81 [2019-11-19 22:33:51,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:33:51,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:51,176 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2019-11-19 22:33:51,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:51,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:51,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:51,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:51,180 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-19 22:33:51,230 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-19 22:33:51,240 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:51,241 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2019-11-19 22:33:51,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:51,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:51,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:51,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:7 [2019-11-19 22:33:51,305 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-19 22:33:51,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:51,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:51,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:51,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:33:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-11-19 22:33:51,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651834705] [2019-11-19 22:33:51,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 22:33:51,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 22:33:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-19 22:33:51,382 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 23 states. [2019-11-19 22:33:52,345 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-19 22:33:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:53,106 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-11-19 22:33:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:33:53,108 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-11-19 22:33:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:53,109 INFO L225 Difference]: With dead ends: 107 [2019-11-19 22:33:53,109 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 22:33:53,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2019-11-19 22:33:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 22:33:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-19 22:33:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-19 22:33:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-11-19 22:33:53,120 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 31 [2019-11-19 22:33:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:53,122 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-11-19 22:33:53,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 22:33:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-11-19 22:33:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:33:53,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:53,132 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:53,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:53,338 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:53,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1599541557, now seen corresponding path program 3 times [2019-11-19 22:33:53,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:53,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032484877] [2019-11-19 22:33:53,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:53,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032484877] [2019-11-19 22:33:53,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672769200] [2019-11-19 22:33:53,881 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:53,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 22:33:53,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:53,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-19 22:33:53,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:53,976 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-19 22:33:53,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:53,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:53,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:53,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:54,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,017 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-19 22:33:54,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,048 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-19 22:33:54,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-19 22:33:54,086 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-19 22:33:54,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,108 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-19 22:33:54,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-19 22:33:54,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:54,177 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-19 22:33:54,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,216 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-19 22:33:54,217 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 1 case distinctions, treesize of input 40 treesize of output 28 [2019-11-19 22:33:54,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,243 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-11-19 22:33:54,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:32 [2019-11-19 22:33:54,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,284 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-19 22:33:54,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:41 [2019-11-19 22:33:54,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-19 22:33:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:54,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:54,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 22:33:54,419 INFO L567 ElimStorePlain]: treesize reduction 104, result has 49.3 percent of original size [2019-11-19 22:33:54,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, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 79 [2019-11-19 22:33:54,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,443 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-19 22:33:54,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-19 22:33:54,489 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|], 6=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-19 22:33:54,495 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 53 treesize of output 35 [2019-11-19 22:33:54,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,565 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 246 [2019-11-19 22:33:54,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,612 INFO L567 ElimStorePlain]: treesize reduction 100, result has 59.5 percent of original size [2019-11-19 22:33:54,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 134 [2019-11-19 22:33:54,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:54,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:54,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:54,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:54,654 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,698 INFO L567 ElimStorePlain]: treesize reduction 290, result has 23.9 percent of original size [2019-11-19 22:33:54,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,698 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-19 22:33:54,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,925 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 121 treesize of output 70 [2019-11-19 22:33:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:54,927 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-19 22:33:54,958 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-19 22:33:54,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-19 22:33:54,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:54,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:54,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:54,983 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-19 22:33:55,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:55,060 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-19 22:33:55,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:55,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:55,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:55,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-19 22:33:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:55,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:33:55,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-19 22:33:55,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859288400] [2019-11-19 22:33:55,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:33:55,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:33:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:33:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:33:55,110 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 22 states. [2019-11-19 22:33:55,876 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-19 22:33:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:56,140 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-19 22:33:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:33:56,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-11-19 22:33:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:56,141 INFO L225 Difference]: With dead ends: 95 [2019-11-19 22:33:56,141 INFO L226 Difference]: Without dead ends: 81 [2019-11-19 22:33:56,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2019-11-19 22:33:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-19 22:33:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2019-11-19 22:33:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-19 22:33:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-11-19 22:33:56,148 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 31 [2019-11-19 22:33:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:56,148 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-11-19 22:33:56,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:33:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-11-19 22:33:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:33:56,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:56,150 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:56,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:56,355 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2139162763, now seen corresponding path program 6 times [2019-11-19 22:33:56,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:56,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919159032] [2019-11-19 22:33:56,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:33:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:33:56,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919159032] [2019-11-19 22:33:56,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76456232] [2019-11-19 22:33:56,880 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:56,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-19 22:33:56,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:33:56,965 WARN L253 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-19 22:33:56,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:33:56,975 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-19 22:33:56,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:56,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:56,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:56,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:33:57,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,006 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-19 22:33:57,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,038 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-19 22:33:57,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-19 22:33:57,056 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-19 22:33:57,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,091 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-19 22:33:57,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,118 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-19 22:33:57,118 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-19 22:33:57,139 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_42|]} [2019-11-19 22:33:57,146 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-19 22:33:57,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,190 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 30 treesize of output 14 [2019-11-19 22:33:57,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,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, 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-19 22:33:57,226 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,243 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:42 [2019-11-19 22:33:57,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,267 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-19 22:33:57,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:44 [2019-11-19 22:33:57,325 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_41|], 3=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-11-19 22:33:57,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:57,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-19 22:33:57,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:33:57,387 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:33:57,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,410 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 34 treesize of output 49 [2019-11-19 22:33:57,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,504 INFO L567 ElimStorePlain]: treesize reduction 41, result has 68.9 percent of original size [2019-11-19 22:33:57,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,530 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 78 treesize of output 101 [2019-11-19 22:33:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,533 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,650 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-11-19 22:33:57,651 INFO L567 ElimStorePlain]: treesize reduction 154, result has 30.6 percent of original size [2019-11-19 22:33:57,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,652 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:83 [2019-11-19 22:33:57,711 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_42|, |v_#memory_$Pointer$.offset_42|], 6=[|v_#memory_$Pointer$.base_44|]} [2019-11-19 22:33:57,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:57,725 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 27 treesize of output 26 [2019-11-19 22:33:57,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:57,806 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-19 22:33:57,806 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 1 case distinctions, treesize of input 95 treesize of output 75 [2019-11-19 22:33:57,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,861 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.2 percent of original size [2019-11-19 22:33:57,913 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-19 22:33:57,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 60 [2019-11-19 22:33:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:57,917 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-19 22:33:57,959 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-11-19 22:33:57,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:33:57,960 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:124, output treesize:52 [2019-11-19 22:33:58,063 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 5=[|v_#memory_$Pointer$.base_45|], 6=[|v_#memory_int_43|]} [2019-11-19 22:33:58,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-19 22:33:58,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:58,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:58,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:58,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-19 22:33:58,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,177 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:58,343 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-11-19 22:33:58,343 INFO L567 ElimStorePlain]: treesize reduction 1181, result has 11.9 percent of original size [2019-11-19 22:33:58,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:33:58,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 112 [2019-11-19 22:33:58,361 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:58,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:58,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:58,402 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-19 22:33:58,526 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_46|], 6=[|v_#memory_$Pointer$.offset_44|, |v_#memory_int_44|]} [2019-11-19 22:33:58,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:58,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-19 22:33:58,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:58,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:33:58,677 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:58,825 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-19 22:33:58,825 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-19 22:33:58,934 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-19 22:33:58,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:58,935 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 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-19 22:33:58,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:59,031 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-19 22:33:59,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:59,089 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-19 22:33:59,089 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:59,228 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-19 22:33:59,229 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-19 22:33:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:33:59,233 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-19 22:33:59,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,707 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-19 22:33:59,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:33:59,721 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_7], 1=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_3, v_prenex_11, v_prenex_6], 2=[v_prenex_12, v_prenex_4]} [2019-11-19 22:33:59,736 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 82 treesize of output 74 [2019-11-19 22:33:59,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:33:59,986 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-11-19 22:33:59,986 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.4 percent of original size [2019-11-19 22:33:59,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:33:59,998 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 70 treesize of output 57 [2019-11-19 22:33:59,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:33:59,999 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-19 22:34:00,198 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-19 22:34:00,198 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-19 22:34:00,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:00,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-11-19 22:34:00,207 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:00,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,298 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 107 treesize of output 74 [2019-11-19 22:34:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,300 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:00,478 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 103 [2019-11-19 22:34:00,479 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.4 percent of original size [2019-11-19 22:34:00,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,499 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 100 treesize of output 67 [2019-11-19 22:34:00,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,501 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-19 22:34:00,658 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-11-19 22:34:00,658 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.3 percent of original size [2019-11-19 22:34:00,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,669 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 59 treesize of output 46 [2019-11-19 22:34:00,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:00,670 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-19 22:34:00,812 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-19 22:34:00,813 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2019-11-19 22:34:00,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-19 22:34:00,820 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:00,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-19 22:34:00,890 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:00,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:00,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-19 22:34:00,949 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:372, output treesize:143 [2019-11-19 22:34:01,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:01,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:01,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-19 22:34:01,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:01,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:01,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:01,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-19 22:34:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:01,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:01,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2019-11-19 22:34:01,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190286233] [2019-11-19 22:34:01,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-19 22:34:01,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-19 22:34:01,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2019-11-19 22:34:01,277 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 26 states. [2019-11-19 22:34:02,248 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-19 22:34:02,585 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-11-19 22:34:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:02,933 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-19 22:34:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:34:02,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2019-11-19 22:34:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:02,935 INFO L225 Difference]: With dead ends: 91 [2019-11-19 22:34:02,935 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 22:34:02,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 22:34:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 22:34:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-19 22:34:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:34:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-19 22:34:02,946 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 33 [2019-11-19 22:34:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:02,946 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-19 22:34:02,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-19 22:34:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-19 22:34:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:34:02,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:02,948 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:03,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:03,153 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 170644940, now seen corresponding path program 4 times [2019-11-19 22:34:03,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:03,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144246291] [2019-11-19 22:34:03,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:03,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144246291] [2019-11-19 22:34:03,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806952343] [2019-11-19 22:34:03,720 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:03,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 22:34:03,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:34:03,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-19 22:34:03,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:03,840 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-19 22:34:03,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:03,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:03,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:03,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:34:03,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:03,935 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-19 22:34:03,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:03,959 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-19 22:34:03,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:03,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-19 22:34:04,008 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 13 treesize of output 9 [2019-11-19 22:34:04,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,030 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 13 treesize of output 9 [2019-11-19 22:34:04,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,046 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-19 22:34:04,087 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_46|]} [2019-11-19 22:34:04,093 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-19 22:34:04,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,169 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-19 22:34:04,169 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-11-19 22:34:04,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,208 INFO L567 ElimStorePlain]: treesize reduction 10, result has 84.6 percent of original size [2019-11-19 22:34:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-19 22:34:04,213 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,226 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:40 [2019-11-19 22:34:04,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-19 22:34:04,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,395 INFO L567 ElimStorePlain]: treesize reduction 28, result has 65.4 percent of original size [2019-11-19 22:34:04,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:53 [2019-11-19 22:34:04,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 165 [2019-11-19 22:34:04,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:04,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:04,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 22:34:04,599 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-19 22:34:04,600 INFO L567 ElimStorePlain]: treesize reduction 188, result has 50.0 percent of original size [2019-11-19 22:34:04,614 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 139 [2019-11-19 22:34:04,615 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:04,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-11-19 22:34:04,667 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:04,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,699 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:197, output treesize:140 [2019-11-19 22:34:04,765 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|, |v_#memory_int_47|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-19 22:34:04,797 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-19 22:34:04,797 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 1 case distinctions, treesize of input 129 treesize of output 103 [2019-11-19 22:34:04,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:04,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:04,799 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-19 22:34:04,882 INFO L567 ElimStorePlain]: treesize reduction 10, result has 93.5 percent of original size [2019-11-19 22:34:04,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:04,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-19 22:34:04,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:04,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,012 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-19 22:34:05,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 90 [2019-11-19 22:34:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,015 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-19 22:34:05,080 INFO L567 ElimStorePlain]: treesize reduction 36, result has 65.7 percent of original size [2019-11-19 22:34:05,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:05,081 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:93 [2019-11-19 22:34:05,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-11-19 22:34:05,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:05,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:34:05,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:90 [2019-11-19 22:34:05,274 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_49|], 6=[|v_#memory_int_48|, |v_#memory_$Pointer$.base_51|]} [2019-11-19 22:34:05,294 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 267 [2019-11-19 22:34:05,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 22:34:05,414 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-19 22:34:05,414 INFO L567 ElimStorePlain]: treesize reduction 604, result has 34.5 percent of original size [2019-11-19 22:34:05,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:34:05,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 226 [2019-11-19 22:34:05,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:05,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 206 [2019-11-19 22:34:05,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,505 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-19 22:34:05,609 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-11-19 22:34:05,609 INFO L567 ElimStorePlain]: treesize reduction 441, result has 33.6 percent of original size [2019-11-19 22:34:05,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:05,613 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:339, output treesize:132 [2019-11-19 22:34:05,681 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_50|], 6=[|v_#memory_int_49|], 12=[|v_#memory_$Pointer$.base_52|]} [2019-11-19 22:34:05,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,705 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 298 [2019-11-19 22:34:05,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:05,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:05,709 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-19 22:34:05,788 INFO L567 ElimStorePlain]: treesize reduction 60, result has 79.6 percent of original size [2019-11-19 22:34:05,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:05,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 238 [2019-11-19 22:34:05,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:05,958 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-11-19 22:34:05,958 INFO L567 ElimStorePlain]: treesize reduction 104, result has 73.1 percent of original size [2019-11-19 22:34:06,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:06,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 266 [2019-11-19 22:34:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:06,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:06,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:07,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:07,821 INFO L496 ElimStorePlain]: Start of recursive call 4: 96 dim-0 vars, End of recursive call: 96 dim-0 vars, and 15 xjuncts. [2019-11-19 22:34:19,868 WARN L191 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 2606 DAG size of output: 780 [2019-11-19 22:34:19,870 INFO L567 ElimStorePlain]: treesize reduction 85847, result has 3.9 percent of original size [2019-11-19 22:34:19,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:19,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:19,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-19 22:34:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:19,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:19,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-19 22:34:19,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:19,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:19,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:19,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:19,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 91 dim-0 vars, and 37 xjuncts. [2019-11-19 22:34:19,900 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:338, output treesize:3840 [2019-11-19 22:34:19,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:21,721 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 988 DAG size of output: 131 [2019-11-19 22:34:21,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:21,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:21,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:22,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:34:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:22,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:22,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:34:22,053 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 132=[|#memory_$Pointer$.base|]} [2019-11-19 22:34:22,063 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 150 treesize of output 114 [2019-11-19 22:34:22,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,073 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 125 treesize of output 121 [2019-11-19 22:34:22,074 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 114 [2019-11-19 22:34:22,083 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2019-11-19 22:34:22,093 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,102 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 154 treesize of output 118 [2019-11-19 22:34:22,103 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,112 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 168 treesize of output 126 [2019-11-19 22:34:22,113 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,122 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 156 treesize of output 120 [2019-11-19 22:34:22,123 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,296 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-19 22:34:22,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,336 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 87 [2019-11-19 22:34:22,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,339 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 87 [2019-11-19 22:34:22,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,378 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,412 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 111 treesize of output 58 [2019-11-19 22:34:22,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,414 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,426 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 42 [2019-11-19 22:34:22,426 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-19 22:34:22,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,471 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 91 [2019-11-19 22:34:22,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,480 INFO L496 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,522 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,523 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 90 [2019-11-19 22:34:22,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,526 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,557 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:34:22,558 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 93 [2019-11-19 22:34:22,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:34:22,562 INFO L496 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:34:22,815 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 113 [2019-11-19 22:34:22,815 INFO L567 ElimStorePlain]: treesize reduction 204, result has 53.1 percent of original size [2019-11-19 22:34:22,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-2 vars, End of recursive call: 23 dim-0 vars, and 7 xjuncts. [2019-11-19 22:34:22,817 INFO L221 ElimStorePlain]: Needed 15 recursive calls to eliminate 14 variables, input treesize:991, output treesize:191 [2019-11-19 22:34:35,384 WARN L191 SmtUtils]: Spent 12.47 s on a formula simplification. DAG size of input: 121 DAG size of output: 94 [2019-11-19 22:34:44,188 WARN L191 SmtUtils]: Spent 8.67 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-19 22:34:44,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:35:00,545 WARN L191 SmtUtils]: Spent 16.27 s on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-11-19 22:35:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:00,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:00,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-11-19 22:35:00,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267498741] [2019-11-19 22:35:00,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-19 22:35:00,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-19 22:35:00,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-11-19 22:35:00,587 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 31 states. [2019-11-19 22:35:02,109 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-11-19 22:35:02,474 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 46 [2019-11-19 22:35:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:05,309 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-11-19 22:35:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 22:35:05,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-11-19 22:35:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:05,311 INFO L225 Difference]: With dead ends: 108 [2019-11-19 22:35:05,311 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:35:05,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=333, Invalid=2319, Unknown=0, NotChecked=0, Total=2652 [2019-11-19 22:35:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:35:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:35:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:35:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:35:05,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-19 22:35:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:05,314 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:35:05,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-19 22:35:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:35:05,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:35:05,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:05,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:35:05,662 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 141 [2019-11-19 22:35:05,808 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 401 DAG size of output: 267 [2019-11-19 22:35:06,036 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 24 [2019-11-19 22:35:06,431 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 23 [2019-11-19 22:35:06,449 INFO L447 ceAbstractionStarter]: At program point L514-1(line 514) the Hoare annotation is: true [2019-11-19 22:35:06,449 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 543 544) no Hoare annotation was computed. [2019-11-19 22:35:06,449 INFO L440 ceAbstractionStarter]: At program point L543-3(lines 543 544) the Hoare annotation is: (or (and (= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3) (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base)) (and (= ULTIMATE.start_main_~a~0.offset 0) (and (= ULTIMATE.start_main_~flag~0 0) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base))))) [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L543-4(lines 539 544) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L527-2(lines 527 531) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 540 541) no Hoare annotation was computed. [2019-11-19 22:35:06,450 INFO L440 ceAbstractionStarter]: At program point L540-3(lines 540 541) the Hoare annotation is: (or (and (= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3) (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base)) (and (= ULTIMATE.start_main_~a~0.offset 0) (and (not (= ULTIMATE.start_main_~flag~0 0)) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base))))) [2019-11-19 22:35:06,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 546) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L524-1(line 524) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 547) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 546) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L533-1(line 533) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2019-11-19 22:35:06,451 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 526 536) no Hoare annotation was computed. [2019-11-19 22:35:06,452 INFO L440 ceAbstractionStarter]: At program point L526-3(lines 526 536) the Hoare annotation is: (and (= ULTIMATE.start_main_~a~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base))) [2019-11-19 22:35:06,452 INFO L444 ceAbstractionStarter]: For program point L526-4(lines 526 536) no Hoare annotation was computed. [2019-11-19 22:35:06,452 INFO L447 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: true [2019-11-19 22:35:06,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,475 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:35:06 BoogieIcfgContainer [2019-11-19 22:35:06,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:35:06,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:35:06,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:35:06,488 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:35:06,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:33:26" (3/4) ... [2019-11-19 22:35:06,493 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:35:06,514 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 22:35:06,515 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:35:06,515 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 22:35:06,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d57394a-1673-4ec7-a68f-ba16c9ccfa61/bin/uautomizer/witness.graphml [2019-11-19 22:35:06,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:35:06,581 INFO L168 Benchmark]: Toolchain (without parser) took 101201.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 333.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,582 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:35:06,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:35:06,583 INFO L168 Benchmark]: Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,583 INFO L168 Benchmark]: RCFGBuilder took 510.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,584 INFO L168 Benchmark]: TraceAbstraction took 99631.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 339.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,584 INFO L168 Benchmark]: Witness Printer took 92.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:35:06,591 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 843.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 510.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99631.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.2 MB). Peak memory consumption was 339.2 MB. Max. memory is 11.5 GB. * Witness Printer took 92.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 540]: Loop Invariant [2019-11-19 22:35:06,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,608 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((unknown-#memory_int-unknown[p][p] == 3 && a == p) && a == p) || (a == 0 && !(flag == 0) && 1 == \valid[a]) - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 543]: Loop Invariant [2019-11-19 22:35:06,611 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:35:06,612 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((unknown-#memory_int-unknown[p][p] == 3 && a == p) && a == p) || (a == 0 && flag == 0 && 1 == \valid[a]) - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: a == 0 && 1 == \valid[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 99.5s, OverallIterations: 20, TraceHistogramMax: 4, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 406 SDtfs, 1167 SDslu, 2568 SDs, 0 SdLazy, 4317 SolverSat, 530 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 269 SyntacticMatches, 36 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2864 ImplicationChecksByTransitivity, 56.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 240 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 37 NumberOfFragments, 68 HoareAnnotationTreeSize, 5 FomulaSimplifications, 2470335 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 241425 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 76.3s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 790 ConstructedInterpolants, 50 QuantifiedInterpolants, 582242 SizeOfPredicates, 197 NumberOfNonLiveVariables, 1500 ConjunctsInSsa, 665 ConjunctsInUnsatCore, 34 InterpolantComputations, 6 PerfectInterpolantSequences, 52/368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...