./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/pcompf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/pcompf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 16624b067519fb2ac0ab1061aff3caf92c786a52 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/pcompf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 16624b067519fb2ac0ab1061aff3caf92c786a52 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 18:43:37,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:43:37,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:43:37,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:43:37,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:43:37,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:43:37,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:43:37,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:43:37,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:43:37,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:43:37,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:43:37,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:43:37,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:43:37,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:43:37,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:43:37,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:43:37,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:43:37,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:43:37,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:43:37,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:43:37,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:43:37,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:43:37,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:43:37,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:43:37,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:43:37,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:43:37,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:43:37,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:43:37,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:43:37,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:43:37,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:43:37,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:43:37,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:43:37,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:43:37,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:43:37,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:43:37,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:43:37,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:43:37,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:43:37,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:43:37,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:43:37,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 18:43:37,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:43:37,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:43:37,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:43:37,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:43:37,923 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:43:37,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:43:37,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:43:37,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 18:43:37,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:43:37,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:43:37,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 18:43:37,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:43:37,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 18:43:37,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:43:37,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 18:43:37,927 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:43:37,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 18:43:37,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:43:37,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:43:37,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:43:37,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:43:37,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:43:37,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:43:37,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:43:37,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 18:43:37,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 18:43:37,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 18:43:37,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 18:43:37,931 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 16624b067519fb2ac0ab1061aff3caf92c786a52 [2019-11-27 18:43:38,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:43:38,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:43:38,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:43:38,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:43:38,266 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:43:38,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcompf.c [2019-11-27 18:43:38,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301d660e7/6812f7d55bf8483cb17a209d4e2a4ea2/FLAGd41dee381 [2019-11-27 18:43:38,853 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:43:38,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c [2019-11-27 18:43:38,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301d660e7/6812f7d55bf8483cb17a209d4e2a4ea2/FLAGd41dee381 [2019-11-27 18:43:39,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301d660e7/6812f7d55bf8483cb17a209d4e2a4ea2 [2019-11-27 18:43:39,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:43:39,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 18:43:39,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:43:39,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:43:39,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:43:39,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e301d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39, skipping insertion in model container [2019-11-27 18:43:39,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:43:39,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:43:39,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:43:39,424 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:43:39,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:43:39,460 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:43:39,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39 WrapperNode [2019-11-27 18:43:39,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:43:39,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 18:43:39,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 18:43:39,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 18:43:39,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 18:43:39,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:43:39,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:43:39,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:43:39,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... [2019-11-27 18:43:39,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:43:39,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:43:39,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:43:39,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:43:39,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:43:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 18:43:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:43:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:43:39,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:43:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 18:43:39,951 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:43:39,951 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-27 18:43:39,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:43:39 BoogieIcfgContainer [2019-11-27 18:43:39,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:43:39,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:43:39,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:43:39,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:43:39,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:43:39" (1/3) ... [2019-11-27 18:43:39,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471265f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:43:39, skipping insertion in model container [2019-11-27 18:43:39,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:43:39" (2/3) ... [2019-11-27 18:43:39,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@471265f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:43:39, skipping insertion in model container [2019-11-27 18:43:39,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:43:39" (3/3) ... [2019-11-27 18:43:39,961 INFO L109 eAbstractionObserver]: Analyzing ICFG pcompf.c [2019-11-27 18:43:39,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:43:39,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 18:43:40,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 18:43:40,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:43:40,022 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 18:43:40,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:43:40,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:43:40,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:43:40,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:43:40,023 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:43:40,023 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:43:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-27 18:43:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:43:40,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:40,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1553700779, now seen corresponding path program 1 times [2019-11-27 18:43:40,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:40,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347251522] [2019-11-27 18:43:40,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:40,200 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-27 18:43:40,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347251522] [2019-11-27 18:43:40,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:40,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 18:43:40,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126197098] [2019-11-27 18:43:40,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 18:43:40,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 18:43:40,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:43:40,227 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-11-27 18:43:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:40,247 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-11-27 18:43:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 18:43:40,249 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-27 18:43:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:40,260 INFO L225 Difference]: With dead ends: 39 [2019-11-27 18:43:40,260 INFO L226 Difference]: Without dead ends: 18 [2019-11-27 18:43:40,264 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-27 18:43:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-27 18:43:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-27 18:43:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 18:43:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-27 18:43:40,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2019-11-27 18:43:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:40,310 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-27 18:43:40,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 18:43:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-27 18:43:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:43:40,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:40,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1516529121, now seen corresponding path program 1 times [2019-11-27 18:43:40,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:40,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24023820] [2019-11-27 18:43:40,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:40,338 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:40,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056132017] [2019-11-27 18:43:40,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:40,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 18:43:40,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:40,636 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-11-27 18:43:40,642 INFO L343 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2019-11-27 18:43:40,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 77 [2019-11-27 18:43:40,648 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:40,737 INFO L588 ElimStorePlain]: treesize reduction 32, result has 58.4 percent of original size [2019-11-27 18:43:40,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:40,747 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:40,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2019-11-27 18:43:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:40,794 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-27 18:43:40,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24023820] [2019-11-27 18:43:40,795 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:40,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056132017] [2019-11-27 18:43:40,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:40,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:43:40,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741235252] [2019-11-27 18:43:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:40,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:40,801 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-11-27 18:43:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:40,918 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-11-27 18:43:40,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:43:40,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-27 18:43:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:40,921 INFO L225 Difference]: With dead ends: 37 [2019-11-27 18:43:40,921 INFO L226 Difference]: Without dead ends: 35 [2019-11-27 18:43:40,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-27 18:43:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-11-27 18:43:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 18:43:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-27 18:43:40,931 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 12 [2019-11-27 18:43:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:40,932 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-27 18:43:40,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-27 18:43:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 18:43:40,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:40,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:41,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash 254811901, now seen corresponding path program 1 times [2019-11-27 18:43:41,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:41,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282995742] [2019-11-27 18:43:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:41,180 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:41,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361168311] [2019-11-27 18:43:41,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:41,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 18:43:41,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:41,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282995742] [2019-11-27 18:43:41,299 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:41,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361168311] [2019-11-27 18:43:41,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:41,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 18:43:41,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096211162] [2019-11-27 18:43:41,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:41,306 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 5 states. [2019-11-27 18:43:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:41,431 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-27 18:43:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 18:43:41,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-27 18:43:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:41,433 INFO L225 Difference]: With dead ends: 60 [2019-11-27 18:43:41,433 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 18:43:41,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 18:43:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2019-11-27 18:43:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 18:43:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-27 18:43:41,442 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 14 [2019-11-27 18:43:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:41,443 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-27 18:43:41,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-27 18:43:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 18:43:41,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:41,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:41,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1045499773, now seen corresponding path program 1 times [2019-11-27 18:43:41,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627116147] [2019-11-27 18:43:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:41,684 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:41,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401405530] [2019-11-27 18:43:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:41,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 18:43:41,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:43:41,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627116147] [2019-11-27 18:43:41,769 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:41,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401405530] [2019-11-27 18:43:41,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-27 18:43:41,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-27 18:43:41,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914072438] [2019-11-27 18:43:41,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 18:43:41,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 18:43:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 18:43:41,773 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-11-27 18:43:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:41,880 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-27 18:43:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:43:41,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-27 18:43:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:41,885 INFO L225 Difference]: With dead ends: 51 [2019-11-27 18:43:41,885 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 18:43:41,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-27 18:43:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 18:43:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-11-27 18:43:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 18:43:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-27 18:43:41,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2019-11-27 18:43:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:41,893 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-27 18:43:41,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 18:43:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-27 18:43:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:43:41,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:41,895 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:42,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,099 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -454926763, now seen corresponding path program 1 times [2019-11-27 18:43:42,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:42,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054758535] [2019-11-27 18:43:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:42,116 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:42,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824109416] [2019-11-27 18:43:42,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:42,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 18:43:42,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:42,203 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-27 18:43:42,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054758535] [2019-11-27 18:43:42,204 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-27 18:43:42,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824109416] [2019-11-27 18:43:42,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:43:42,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 18:43:42,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62939953] [2019-11-27 18:43:42,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 18:43:42,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 18:43:42,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 18:43:42,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 18:43:42,207 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-11-27 18:43:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:43:42,316 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-27 18:43:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 18:43:42,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-27 18:43:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:43:42,318 INFO L225 Difference]: With dead ends: 46 [2019-11-27 18:43:42,318 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 18:43:42,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-27 18:43:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 18:43:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-27 18:43:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-27 18:43:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-27 18:43:42,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2019-11-27 18:43:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:43:42,325 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-27 18:43:42,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 18:43:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-27 18:43:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 18:43:42,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:43:42,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:43:42,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,530 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:43:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:43:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 392653561, now seen corresponding path program 1 times [2019-11-27 18:43:42,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 18:43:42,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133980268] [2019-11-27 18:43:42,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 18:43:42,558 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-27 18:43:42,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434870757] [2019-11-27 18:43:42,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:43:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:43:42,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-27 18:43:42,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:43:42,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-27 18:43:42,634 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,648 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-27 18:43:42,678 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,724 INFO L588 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2019-11-27 18:43:42,724 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:38 [2019-11-27 18:43:42,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:42,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:42,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:42,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 85 [2019-11-27 18:43:42,802 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:42,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:42,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:42,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 158 [2019-11-27 18:43:42,905 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:43,056 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-11-27 18:43:43,058 INFO L588 ElimStorePlain]: treesize reduction 170, result has 41.4 percent of original size [2019-11-27 18:43:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,066 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-27 18:43:43,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:120 [2019-11-27 18:43:43,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:43,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 143 [2019-11-27 18:43:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,406 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:43,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,642 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-27 18:43:43,644 INFO L343 Elim1Store]: treesize reduction 17, result has 92.5 percent of original size [2019-11-27 18:43:43,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 252 [2019-11-27 18:43:43,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:43,656 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:43,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:43,804 INFO L237 Elim1Store]: Index analysis took 124 ms [2019-11-27 18:43:44,198 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-27 18:43:44,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:44,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 79 treesize of output 530 [2019-11-27 18:43:44,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,240 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:44,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:44,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:44,388 INFO L237 Elim1Store]: Index analysis took 105 ms [2019-11-27 18:43:44,771 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-11-27 18:43:44,773 INFO L343 Elim1Store]: treesize reduction 14, result has 95.7 percent of original size [2019-11-27 18:43:44,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 65 treesize of output 356 [2019-11-27 18:43:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:44,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:44,784 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:44,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:44,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:43:45,046 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 18:43:45,046 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:43:45,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 72 treesize of output 378 [2019-11-27 18:43:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:45,062 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-27 18:43:48,040 WARN L192 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 496 DAG size of output: 197 [2019-11-27 18:43:48,044 INFO L588 ElimStorePlain]: treesize reduction 5041, result has 21.2 percent of original size [2019-11-27 18:43:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,693 INFO L508 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-11-27 18:43:48,694 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:357, output treesize:1354 [2019-11-27 18:43:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:48,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,723 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2019-11-27 18:43:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:49,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:43:50,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 18:43:50,578 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-27 18:47:02,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 18:47:02,162 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-11-27 18:47:02,171 INFO L168 Benchmark]: Toolchain (without parser) took 202991.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.4 MB). Free memory was 960.4 MB in the beginning and 834.1 MB in the end (delta: 126.2 MB). Peak memory consumption was 544.6 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:02,174 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:47:02,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:02,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:02,180 INFO L168 Benchmark]: Boogie Preprocessor took 28.05 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-27 18:47:02,182 INFO L168 Benchmark]: RCFGBuilder took 353.99 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:02,185 INFO L168 Benchmark]: TraceAbstraction took 202215.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 1.1 GB in the beginning and 834.1 MB in the end (delta: 277.4 MB). Peak memory consumption was 555.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:47:02,192 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.05 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. * RCFGBuilder took 353.99 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: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 202215.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 277.9 MB). Free memory was 1.1 GB in the beginning and 834.1 MB in the end (delta: 277.4 MB). Peak memory consumption was 555.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-3c39aff [2019-11-27 18:47:03,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 18:47:03,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 18:47:03,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 18:47:03,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 18:47:03,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 18:47:03,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 18:47:04,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 18:47:04,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 18:47:04,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 18:47:04,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 18:47:04,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 18:47:04,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 18:47:04,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 18:47:04,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 18:47:04,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 18:47:04,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 18:47:04,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 18:47:04,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 18:47:04,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 18:47:04,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 18:47:04,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 18:47:04,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 18:47:04,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 18:47:04,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 18:47:04,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 18:47:04,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 18:47:04,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 18:47:04,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 18:47:04,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 18:47:04,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 18:47:04,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 18:47:04,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 18:47:04,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 18:47:04,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 18:47:04,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 18:47:04,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 18:47:04,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 18:47:04,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 18:47:04,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 18:47:04,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 18:47:04,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 18:47:04,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 18:47:04,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 18:47:04,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 18:47:04,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 18:47:04,057 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 18:47:04,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 18:47:04,058 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 18:47:04,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 18:47:04,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 18:47:04,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 18:47:04,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 18:47:04,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 18:47:04,059 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 18:47:04,059 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 18:47:04,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 18:47:04,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 18:47:04,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 18:47:04,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 18:47:04,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 18:47:04,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 18:47:04,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 18:47:04,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 18:47:04,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:47:04,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 18:47:04,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 18:47:04,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 18:47:04,062 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 18:47:04,062 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 18:47:04,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 18:47:04,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 18:47:04,063 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 16624b067519fb2ac0ab1061aff3caf92c786a52 [2019-11-27 18:47:04,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 18:47:04,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 18:47:04,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 18:47:04,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 18:47:04,386 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 18:47:04,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcompf.c [2019-11-27 18:47:04,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be100d/ab1839aeba8c4335a3140759212a8b66/FLAG55968d6cd [2019-11-27 18:47:04,938 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 18:47:04,940 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c [2019-11-27 18:47:04,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be100d/ab1839aeba8c4335a3140759212a8b66/FLAG55968d6cd [2019-11-27 18:47:05,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db4be100d/ab1839aeba8c4335a3140759212a8b66 [2019-11-27 18:47:05,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 18:47:05,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 18:47:05,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 18:47:05,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 18:47:05,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 18:47:05,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6373eea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05, skipping insertion in model container [2019-11-27 18:47:05,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 18:47:05,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 18:47:05,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:47:05,571 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 18:47:05,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 18:47:05,672 INFO L208 MainTranslator]: Completed translation [2019-11-27 18:47:05,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05 WrapperNode [2019-11-27 18:47:05,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 18:47:05,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 18:47:05,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 18:47:05,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 18:47:05,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 18:47:05,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 18:47:05,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 18:47:05,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 18:47:05,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... [2019-11-27 18:47:05,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 18:47:05,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 18:47:05,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 18:47:05,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 18:47:05,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 18:47:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-27 18:47:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 18:47:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 18:47:05,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 18:47:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-27 18:47:06,194 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 18:47:06,194 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-27 18:47:06,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:47:06 BoogieIcfgContainer [2019-11-27 18:47:06,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 18:47:06,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 18:47:06,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 18:47:06,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 18:47:06,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:47:05" (1/3) ... [2019-11-27 18:47:06,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5d9c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:47:06, skipping insertion in model container [2019-11-27 18:47:06,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:47:05" (2/3) ... [2019-11-27 18:47:06,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5d9c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:47:06, skipping insertion in model container [2019-11-27 18:47:06,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:47:06" (3/3) ... [2019-11-27 18:47:06,205 INFO L109 eAbstractionObserver]: Analyzing ICFG pcompf.c [2019-11-27 18:47:06,216 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 18:47:06,227 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 18:47:06,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 18:47:06,265 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 18:47:06,265 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 18:47:06,266 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 18:47:06,266 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 18:47:06,266 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 18:47:06,266 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 18:47:06,266 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 18:47:06,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 18:47:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-11-27 18:47:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:47:06,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:06,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:06,285 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:47:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1553700779, now seen corresponding path program 1 times [2019-11-27 18:47:06,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:47:06,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150689611] [2019-11-27 18:47:06,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 18:47:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:06,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 18:47:06,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:47:06,412 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-27 18:47:06,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:47:06,417 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-27 18:47:06,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150689611] [2019-11-27 18:47:06,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:06,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 18:47:06,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71056462] [2019-11-27 18:47:06,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 18:47:06,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:47:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 18:47:06,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 18:47:06,441 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-11-27 18:47:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:06,461 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-11-27 18:47:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 18:47:06,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-27 18:47:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:06,474 INFO L225 Difference]: With dead ends: 39 [2019-11-27 18:47:06,475 INFO L226 Difference]: Without dead ends: 18 [2019-11-27 18:47:06,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-27 18:47:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-27 18:47:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-27 18:47:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 18:47:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-27 18:47:06,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2019-11-27 18:47:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:06,515 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-27 18:47:06,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 18:47:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-27 18:47:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 18:47:06,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:06,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:06,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 18:47:06,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:47:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1516529121, now seen corresponding path program 1 times [2019-11-27 18:47:06,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:47:06,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863185805] [2019-11-27 18:47:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 18:47:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:06,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 18:47:06,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:47:06,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:06,899 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:06,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:06,909 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:06,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:15,247 WARN L192 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 54 DAG size of output: 19 [2019-11-27 18:47:15,249 INFO L343 Elim1Store]: treesize reduction 168, result has 11.1 percent of original size [2019-11-27 18:47:15,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 41 [2019-11-27 18:47:15,251 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:15,278 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:15,280 INFO L508 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-27 18:47:15,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:160, output treesize:44 [2019-11-27 18:47:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:47:15,418 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-27 18:47:15,418 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:47:15,658 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-27 18:47:15,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863185805] [2019-11-27 18:47:15,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 18:47:15,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-27 18:47:15,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538402832] [2019-11-27 18:47:15,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 18:47:15,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:47:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 18:47:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-27 18:47:15,663 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 8 states. [2019-11-27 18:47:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:16,312 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-11-27 18:47:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 18:47:16,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-27 18:47:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:16,316 INFO L225 Difference]: With dead ends: 25 [2019-11-27 18:47:16,316 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 18:47:16,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-27 18:47:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 18:47:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-27 18:47:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 18:47:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-27 18:47:16,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2019-11-27 18:47:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:16,326 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-27 18:47:16,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 18:47:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-27 18:47:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 18:47:16,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:16,327 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:16,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 18:47:16,528 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:47:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash -454926763, now seen corresponding path program 1 times [2019-11-27 18:47:16,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:47:16,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583213691] [2019-11-27 18:47:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 18:47:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:16,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 18:47:16,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:47:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:16,758 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:47:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:16,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583213691] [2019-11-27 18:47:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:47:16,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-27 18:47:16,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88116254] [2019-11-27 18:47:16,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 18:47:16,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:47:16,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 18:47:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-27 18:47:16,857 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2019-11-27 18:47:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:47:17,344 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-11-27 18:47:17,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 18:47:17,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-27 18:47:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:47:17,348 INFO L225 Difference]: With dead ends: 57 [2019-11-27 18:47:17,348 INFO L226 Difference]: Without dead ends: 24 [2019-11-27 18:47:17,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 18:47:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-27 18:47:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-27 18:47:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-27 18:47:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-27 18:47:17,355 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2019-11-27 18:47:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:47:17,356 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-27 18:47:17,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 18:47:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-27 18:47:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 18:47:17,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 18:47:17,357 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 18:47:17,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 18:47:17,560 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 18:47:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 18:47:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -129617361, now seen corresponding path program 1 times [2019-11-27 18:47:17,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 18:47:17,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393025761] [2019-11-27 18:47:17,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 18:47:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 18:47:17,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-27 18:47:17,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 18:47:17,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:17,850 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 23 treesize of output 27 [2019-11-27 18:47:17,851 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,002 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-27 18:47:18,002 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:18,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 18:47:18,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 77 [2019-11-27 18:47:18,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-27 18:47:18,066 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,082 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,082 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,131 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,131 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,131 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:190, output treesize:56 [2019-11-27 18:47:18,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2019-11-27 18:47:18,204 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,256 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,257 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-11-27 18:47:18,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2019-11-27 18:47:18,460 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,518 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,519 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 18:47:18,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2019-11-27 18:47:18,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 18:47:18,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 129 [2019-11-27 18:47:18,754 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 18:47:18,830 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 18:47:18,831 INFO L508 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-27 18:47:18,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:166, output treesize:154 [2019-11-27 18:47:19,725 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2019-11-27 18:47:19,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:47:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:47:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:20,220 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 18:47:21,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 18:47:24,796 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-27 18:47:27,170 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-27 18:47:28,785 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-27 18:47:32,427 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-27 18:47:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 18:47:32,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393025761] [2019-11-27 18:47:32,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 18:47:32,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2019-11-27 18:47:32,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145422022] [2019-11-27 18:47:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-27 18:47:32,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 18:47:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-27 18:47:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=492, Unknown=1, NotChecked=0, Total=552 [2019-11-27 18:47:32,467 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 24 states. [2019-11-27 18:47:34,934 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base)) (.cse11 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (let ((.cse16 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32))) (.cse44 (select .cse36 .cse11)) (.cse17 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse18 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32))) (.cse21 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base))) (let ((.cse25 (select .cse21 c_ULTIMATE.start_main_~c~0.offset)) (.cse29 (concat (select .cse36 (bvadd .cse18 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse36 (bvadd .cse18 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32))))) (.cse19 (concat (select .cse17 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse18 (_ bv4294967292 32))) (select .cse17 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse18 (_ bv4294967288 32))))) (.cse3 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse2 ((_ sign_extend 32) (_ bv0 32))) (.cse9 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse1 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) (.cse14 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse26 (concat .cse44 (select .cse36 c_ULTIMATE.start_main_~b~0.offset))) (.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse20 ((_ sign_extend 32) (_ bv6 32))) (.cse43 (select .cse17 .cse16))) (and (= (_ bv0 32) c_ULTIMATE.start_main_~b~0.offset) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (not (= c_ULTIMATE.start_main_~c~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse15 (store .cse17 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse18) ((_ extract 31 0) (bvadd .cse19 .cse20))))) (let ((.cse12 (store |c_#memory_int| c_ULTIMATE.start_main_~a~0.base .cse15))) (let ((.cse10 (let ((.cse13 (select .cse12 c_ULTIMATE.start_main_~b~0.base))) (store .cse13 .cse14 ((_ extract 63 32) (bvadd (concat (select .cse15 .cse16) (select .cse15 c_ULTIMATE.start_main_~a~0.offset)) (concat (select .cse13 .cse11) (select .cse13 c_ULTIMATE.start_main_~b~0.offset)))))))) (let ((.cse6 (store .cse12 c_ULTIMATE.start_main_~b~0.base .cse10))) (let ((.cse7 (select .cse6 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse8 (bvadd (concat (select .cse7 .cse1) (select .cse7 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse10 .cse11) (select .cse10 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse4 ((_ extract 31 0) .cse8))) (let ((.cse0 (store .cse7 .cse9 .cse4))) (or (not (= (concat (select .cse0 .cse1) (select .cse0 c_ULTIMATE.start_main_~c~0.offset)) .cse2)) (= (concat (select .cse0 .cse3) .cse4) .cse5) (not (= (store .cse6 c_ULTIMATE.start_main_~c~0.base (store .cse7 .cse3 ((_ extract 63 32) .cse8))) (store .cse6 c_ULTIMATE.start_main_~c~0.base .cse0)))))))))))) (let ((.cse22 (bvadd (concat (select .cse21 .cse1) .cse25) .cse26))) (let ((.cse24 ((_ extract 31 0) .cse22))) (let ((.cse23 (store .cse21 .cse9 .cse24))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse21 .cse3 ((_ extract 63 32) .cse22))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse23))) (not (= .cse2 (concat (select .cse23 .cse1) (select .cse23 c_ULTIMATE.start_main_~c~0.offset)))) (= (concat (select .cse23 .cse3) .cse24) .cse5))))) (let ((.cse27 (bvadd .cse29 (concat (select .cse21 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse18 (_ bv4294967292 32))) (select .cse21 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse18 (_ bv4294967288 32))))))) (let ((.cse28 (store .cse21 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse18) ((_ extract 31 0) .cse27)))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse21 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse18 (_ bv4 32)) ((_ extract 63 32) .cse27))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse28))) (= .cse5 (concat (select .cse28 .cse3) (select .cse28 .cse9))) (not (= .cse2 (concat (select .cse28 .cse1) (select .cse28 c_ULTIMATE.start_main_~c~0.offset))))))) (= (_ bv0 32) c_ULTIMATE.start_main_~c~0.offset) (= .cse25 ((_ extract 31 0) .cse2)) (= (_ bv0 32) c_ULTIMATE.start_main_~a~0.offset) (let ((.cse35 (store .cse36 (bvadd .cse18 c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) (bvadd .cse29 .cse19))))) (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse35))) (let ((.cse32 (select .cse30 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse33 (bvadd (concat (select .cse32 .cse1) (select .cse32 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse35 .cse11) (select .cse35 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse34 ((_ extract 31 0) .cse33))) (let ((.cse31 (store .cse32 .cse9 .cse34))) (or (not (= (store .cse30 c_ULTIMATE.start_main_~c~0.base .cse31) (store .cse30 c_ULTIMATE.start_main_~c~0.base (store .cse32 .cse3 ((_ extract 63 32) .cse33))))) (= .cse5 (concat (select .cse31 .cse3) .cse34)) (not (= (concat (select .cse31 .cse1) (select .cse31 c_ULTIMATE.start_main_~c~0.offset)) .cse2))))))))) (let ((.cse42 (store .cse36 .cse14 ((_ extract 63 32) (bvadd .cse26 (concat .cse43 (select .cse17 c_ULTIMATE.start_main_~a~0.offset))))))) (let ((.cse37 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse42))) (let ((.cse39 (select .cse37 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse40 (bvadd (concat (select .cse39 .cse1) (select .cse39 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse42 .cse11) (select .cse42 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse41 ((_ extract 31 0) .cse40))) (let ((.cse38 (store .cse39 .cse9 .cse41))) (or (not (= (store .cse37 c_ULTIMATE.start_main_~c~0.base .cse38) (store .cse37 c_ULTIMATE.start_main_~c~0.base (store .cse39 .cse3 ((_ extract 63 32) .cse40))))) (= (concat (select .cse38 .cse3) .cse41) .cse5) (not (= (concat (select .cse38 .cse1) (select .cse38 c_ULTIMATE.start_main_~c~0.offset)) .cse2))))))))) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (= ((_ extract 63 32) .cse5) .cse44) (= ((_ extract 63 32) .cse20) .cse43) (= (_ bv1 32) c_ULTIMATE.start_main_~i~0))))) is different from true [2019-11-27 18:47:39,848 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-27 18:48:25,536 WARN L192 SmtUtils]: Spent 17.13 s on a formula simplification that was a NOOP. DAG size: 127 [2019-11-27 18:48:49,136 WARN L192 SmtUtils]: Spent 8.86 s on a formula simplification. DAG size of input: 123 DAG size of output: 89 [2019-11-27 18:49:04,253 WARN L192 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 160 DAG size of output: 140 [2019-11-27 18:49:22,255 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 18:49:50,058 WARN L192 SmtUtils]: Spent 9.89 s on a formula simplification. DAG size of input: 152 DAG size of output: 89 [2019-11-27 18:49:54,887 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse21 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (let ((.cse16 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse46 (select .cse0 .cse21)) (.cse33 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base)) (.cse22 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32))) (.cse4 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base))) (let ((.cse6 (select .cse4 c_ULTIMATE.start_main_~c~0.offset)) (.cse26 (concat (select .cse33 (bvadd .cse22 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse33 (bvadd .cse22 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32))))) (.cse23 (concat (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse22 (_ bv4294967292 32))) (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse22 (_ bv4294967288 32))))) (.cse7 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse3 ((_ sign_extend 32) (_ bv0 32))) (.cse8 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse5 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) (.cse19 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse1 (concat .cse46 (select .cse0 c_ULTIMATE.start_main_~a~0.offset))) (.cse9 ((_ sign_extend 32) (_ bv1 32))) (.cse40 (select .cse33 .cse16)) (.cse2 ((_ sign_extend 32) (_ bv6 32)))) (and (= (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse1 .cse2))) (or (not (= .cse3 (concat (select .cse4 .cse5) .cse6))) (= (concat (select .cse4 .cse7) (select .cse4 .cse8)) .cse9)) (= (_ bv0 32) c_ULTIMATE.start_main_~b~0.offset) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (not (= c_ULTIMATE.start_main_~c~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse20 (store .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse22) ((_ extract 31 0) (bvadd .cse23 .cse2))))) (let ((.cse17 (store |c_#memory_int| c_ULTIMATE.start_main_~a~0.base .cse20))) (let ((.cse15 (let ((.cse18 (select .cse17 c_ULTIMATE.start_main_~b~0.base))) (store .cse18 .cse19 ((_ extract 63 32) (bvadd (concat (select .cse20 .cse21) (select .cse20 c_ULTIMATE.start_main_~a~0.offset)) (concat (select .cse18 .cse16) (select .cse18 c_ULTIMATE.start_main_~b~0.offset)))))))) (let ((.cse12 (store .cse17 c_ULTIMATE.start_main_~b~0.base .cse15))) (let ((.cse13 (select .cse12 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse14 (bvadd (concat (select .cse13 .cse5) (select .cse13 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse15 .cse16) (select .cse15 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse11 ((_ extract 31 0) .cse14))) (let ((.cse10 (store .cse13 .cse8 .cse11))) (or (not (= (concat (select .cse10 .cse5) (select .cse10 c_ULTIMATE.start_main_~c~0.offset)) .cse3)) (= (concat (select .cse10 .cse7) .cse11) .cse9) (not (= (store .cse12 c_ULTIMATE.start_main_~c~0.base (store .cse13 .cse7 ((_ extract 63 32) .cse14))) (store .cse12 c_ULTIMATE.start_main_~c~0.base .cse10)))))))))))) (let ((.cse24 (bvadd .cse26 (concat (select .cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse22 (_ bv4294967292 32))) (select .cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse22 (_ bv4294967288 32))))))) (let ((.cse25 (store .cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse22) ((_ extract 31 0) .cse24)))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse22 (_ bv4 32)) ((_ extract 63 32) .cse24))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse25))) (= .cse9 (concat (select .cse25 .cse7) (select .cse25 .cse8))) (not (= .cse3 (concat (select .cse25 .cse5) (select .cse25 c_ULTIMATE.start_main_~c~0.offset))))))) (= (_ bv0 32) c_ULTIMATE.start_main_~c~0.offset) (= .cse6 ((_ extract 31 0) .cse3)) (= (_ bv0 32) c_ULTIMATE.start_main_~a~0.offset) (let ((.cse32 (store .cse33 (bvadd .cse22 c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) (bvadd .cse26 .cse23))))) (let ((.cse27 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse32))) (let ((.cse29 (select .cse27 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse30 (bvadd (concat (select .cse29 .cse5) (select .cse29 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse32 .cse16) (select .cse32 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse31 ((_ extract 31 0) .cse30))) (let ((.cse28 (store .cse29 .cse8 .cse31))) (or (not (= (store .cse27 c_ULTIMATE.start_main_~c~0.base .cse28) (store .cse27 c_ULTIMATE.start_main_~c~0.base (store .cse29 .cse7 ((_ extract 63 32) .cse30))))) (= .cse9 (concat (select .cse28 .cse7) .cse31)) (not (= (concat (select .cse28 .cse5) (select .cse28 c_ULTIMATE.start_main_~c~0.offset)) .cse3))))))))) (let ((.cse39 (store .cse33 .cse19 ((_ extract 63 32) (bvadd (concat .cse40 (select .cse33 c_ULTIMATE.start_main_~b~0.offset)) .cse1))))) (let ((.cse34 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse39))) (let ((.cse36 (select .cse34 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse37 (bvadd (concat (select .cse36 .cse5) (select .cse36 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse39 .cse16) (select .cse39 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse38 ((_ extract 31 0) .cse37))) (let ((.cse35 (store .cse36 .cse8 .cse38))) (or (not (= (store .cse34 c_ULTIMATE.start_main_~c~0.base .cse35) (store .cse34 c_ULTIMATE.start_main_~c~0.base (store .cse36 .cse7 ((_ extract 63 32) .cse37))))) (= (concat (select .cse35 .cse7) .cse38) .cse9) (not (= (concat (select .cse35 .cse5) (select .cse35 c_ULTIMATE.start_main_~c~0.offset)) .cse3))))))))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse44 ((_ extract 63 32) .cse43)) (.cse41 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse42 (concat .cse44 (select .cse41 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse41 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse42 .cse43))) (= .cse44 (select .cse41 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse45 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base))) (= (select .cse45 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse45 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse45 c_ULTIMATE.start_main_~b~0.offset)) .cse42))))))))) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (= ((_ extract 63 32) .cse9) .cse40) (= ((_ extract 63 32) .cse2) .cse46) (exists ((ULTIMATE.start_main_~b~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse54 (select |c_#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse51 ((_ sign_extend 32) (_ bv6 32))) (.cse52 (select .cse54 (_ bv4 32)))) (let ((.cse55 (concat .cse52 (select .cse54 (_ bv0 32)))) (.cse47 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base)) (.cse53 ((_ extract 63 32) .cse51)) (.cse49 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse50 (concat .cse53 (select .cse49 (_ bv0 32)))) (.cse48 (bvadd .cse55 (concat (select .cse47 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse47 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) ((_ extract 31 0) .cse48)) (not (= c_ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base)) (= (select .cse49 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse50 .cse51))) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) .cse52) (= .cse53 (select .cse49 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select .cse54 (_ bv12 32)) ((_ extract 63 32) (bvadd .cse55 .cse50))) (= ((_ extract 63 32) .cse48) (select .cse47 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32)))))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~i~0))))) is different from true [2019-11-27 18:50:15,389 WARN L192 SmtUtils]: Spent 9.67 s on a formula simplification. DAG size of input: 166 DAG size of output: 87 [2019-11-27 18:50:18,718 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base)) (.cse14 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse0 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse19 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (let ((.cse47 (select .cse0 .cse19)) (.cse46 (select .cse34 .cse14)) (.cse20 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32))) (.cse22 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base))) (let ((.cse26 (select .cse22 c_ULTIMATE.start_main_~c~0.offset)) (.cse21 (concat (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20 (_ bv4294967292 32))) (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20 (_ bv4294967288 32))))) (.cse6 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse5 ((_ sign_extend 32) (_ bv0 32))) (.cse12 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) (.cse17 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse27 (concat .cse46 (select .cse34 c_ULTIMATE.start_main_~b~0.offset))) (.cse1 (concat .cse47 (select .cse0 c_ULTIMATE.start_main_~a~0.offset))) (.cse8 ((_ sign_extend 32) (_ bv1 32))) (.cse2 ((_ sign_extend 32) (_ bv6 32)))) (and (= (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse1 .cse2))) (= (_ bv0 32) c_ULTIMATE.start_main_~b~0.offset) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (not (= c_ULTIMATE.start_main_~c~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse18 (store .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20) ((_ extract 31 0) (bvadd .cse21 .cse2))))) (let ((.cse15 (store |c_#memory_int| c_ULTIMATE.start_main_~a~0.base .cse18))) (let ((.cse13 (let ((.cse16 (select .cse15 c_ULTIMATE.start_main_~b~0.base))) (store .cse16 .cse17 ((_ extract 63 32) (bvadd (concat (select .cse18 .cse19) (select .cse18 c_ULTIMATE.start_main_~a~0.offset)) (concat (select .cse16 .cse14) (select .cse16 c_ULTIMATE.start_main_~b~0.offset)))))))) (let ((.cse9 (store .cse15 c_ULTIMATE.start_main_~b~0.base .cse13))) (let ((.cse10 (select .cse9 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse11 (bvadd (concat (select .cse10 .cse4) (select .cse10 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse13 .cse14) (select .cse13 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse7 ((_ extract 31 0) .cse11))) (let ((.cse3 (store .cse10 .cse12 .cse7))) (or (not (= (concat (select .cse3 .cse4) (select .cse3 c_ULTIMATE.start_main_~c~0.offset)) .cse5)) (= (concat (select .cse3 .cse6) .cse7) .cse8) (not (= (store .cse9 c_ULTIMATE.start_main_~c~0.base (store .cse10 .cse6 ((_ extract 63 32) .cse11))) (store .cse9 c_ULTIMATE.start_main_~c~0.base .cse3)))))))))))) (let ((.cse23 (bvadd (concat (select .cse22 .cse4) .cse26) .cse27))) (let ((.cse25 ((_ extract 31 0) .cse23))) (let ((.cse24 (store .cse22 .cse12 .cse25))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse22 .cse6 ((_ extract 63 32) .cse23))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse24))) (not (= .cse5 (concat (select .cse24 .cse4) (select .cse24 c_ULTIMATE.start_main_~c~0.offset)))) (= (concat (select .cse24 .cse6) .cse25) .cse8))))) (= (_ bv0 32) c_ULTIMATE.start_main_~c~0.offset) (= .cse26 ((_ extract 31 0) .cse5)) (= (_ bv0 32) c_ULTIMATE.start_main_~a~0.offset) (let ((.cse33 (store .cse34 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) (bvadd (concat (select .cse34 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse34 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))) .cse21))))) (let ((.cse28 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse33))) (let ((.cse30 (select .cse28 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse31 (bvadd (concat (select .cse30 .cse4) (select .cse30 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse33 .cse14) (select .cse33 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse32 ((_ extract 31 0) .cse31))) (let ((.cse29 (store .cse30 .cse12 .cse32))) (or (not (= (store .cse28 c_ULTIMATE.start_main_~c~0.base .cse29) (store .cse28 c_ULTIMATE.start_main_~c~0.base (store .cse30 .cse6 ((_ extract 63 32) .cse31))))) (= .cse8 (concat (select .cse29 .cse6) .cse32)) (not (= (concat (select .cse29 .cse4) (select .cse29 c_ULTIMATE.start_main_~c~0.offset)) .cse5))))))))) (let ((.cse40 (store .cse34 .cse17 ((_ extract 63 32) (bvadd .cse27 .cse1))))) (let ((.cse35 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse40))) (let ((.cse37 (select .cse35 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse38 (bvadd (concat (select .cse37 .cse4) (select .cse37 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse40 .cse14) (select .cse40 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse39 ((_ extract 31 0) .cse38))) (let ((.cse36 (store .cse37 .cse12 .cse39))) (or (not (= (store .cse35 c_ULTIMATE.start_main_~c~0.base .cse36) (store .cse35 c_ULTIMATE.start_main_~c~0.base (store .cse37 .cse6 ((_ extract 63 32) .cse38))))) (= (concat (select .cse36 .cse6) .cse39) .cse8) (not (= (concat (select .cse36 .cse4) (select .cse36 c_ULTIMATE.start_main_~c~0.offset)) .cse5))))))))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse43 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse44 ((_ extract 63 32) .cse43)) (.cse41 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse42 (concat .cse44 (select .cse41 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse41 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse42 .cse43))) (= .cse44 (select .cse41 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse45 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base))) (= (select .cse45 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse45 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse45 c_ULTIMATE.start_main_~b~0.offset)) .cse42))))))))) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (= ((_ extract 63 32) .cse8) .cse46) (= ((_ extract 63 32) .cse2) .cse47))))) is different from true [2019-11-27 18:50:21,453 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse37 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base)) (.cse14 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse0 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse19 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (let ((.cse50 (select .cse0 .cse19)) (.cse49 (select .cse37 .cse14)) (.cse20 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32))) (.cse22 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base))) (let ((.cse26 (select .cse22 c_ULTIMATE.start_main_~c~0.offset)) (.cse30 (concat (select .cse37 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse37 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32))))) (.cse21 (concat (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20 (_ bv4294967292 32))) (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20 (_ bv4294967288 32))))) (.cse6 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse5 ((_ sign_extend 32) (_ bv0 32))) (.cse12 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse4 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) (.cse17 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) (.cse27 (concat .cse49 (select .cse37 c_ULTIMATE.start_main_~b~0.offset))) (.cse1 (concat .cse50 (select .cse0 c_ULTIMATE.start_main_~a~0.offset))) (.cse8 ((_ sign_extend 32) (_ bv1 32))) (.cse2 ((_ sign_extend 32) (_ bv6 32)))) (and (= (select .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse1 .cse2))) (= (_ bv0 32) c_ULTIMATE.start_main_~b~0.offset) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (not (= c_ULTIMATE.start_main_~c~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse18 (store .cse0 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse20) ((_ extract 31 0) (bvadd .cse21 .cse2))))) (let ((.cse15 (store |c_#memory_int| c_ULTIMATE.start_main_~a~0.base .cse18))) (let ((.cse13 (let ((.cse16 (select .cse15 c_ULTIMATE.start_main_~b~0.base))) (store .cse16 .cse17 ((_ extract 63 32) (bvadd (concat (select .cse18 .cse19) (select .cse18 c_ULTIMATE.start_main_~a~0.offset)) (concat (select .cse16 .cse14) (select .cse16 c_ULTIMATE.start_main_~b~0.offset)))))))) (let ((.cse9 (store .cse15 c_ULTIMATE.start_main_~b~0.base .cse13))) (let ((.cse10 (select .cse9 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse11 (bvadd (concat (select .cse10 .cse4) (select .cse10 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse13 .cse14) (select .cse13 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse7 ((_ extract 31 0) .cse11))) (let ((.cse3 (store .cse10 .cse12 .cse7))) (or (not (= (concat (select .cse3 .cse4) (select .cse3 c_ULTIMATE.start_main_~c~0.offset)) .cse5)) (= (concat (select .cse3 .cse6) .cse7) .cse8) (not (= (store .cse9 c_ULTIMATE.start_main_~c~0.base (store .cse10 .cse6 ((_ extract 63 32) .cse11))) (store .cse9 c_ULTIMATE.start_main_~c~0.base .cse3)))))))))))) (let ((.cse23 (bvadd (concat (select .cse22 .cse4) .cse26) .cse27))) (let ((.cse25 ((_ extract 31 0) .cse23))) (let ((.cse24 (store .cse22 .cse12 .cse25))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse22 .cse6 ((_ extract 63 32) .cse23))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse24))) (not (= .cse5 (concat (select .cse24 .cse4) (select .cse24 c_ULTIMATE.start_main_~c~0.offset)))) (= (concat (select .cse24 .cse6) .cse25) .cse8))))) (let ((.cse28 (bvadd .cse30 (concat (select .cse22 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse20 (_ bv4294967292 32))) (select .cse22 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse20 (_ bv4294967288 32))))))) (let ((.cse29 (store .cse22 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse20) ((_ extract 31 0) .cse28)))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse22 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse20 (_ bv4 32)) ((_ extract 63 32) .cse28))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse29))) (= .cse8 (concat (select .cse29 .cse6) (select .cse29 .cse12))) (not (= .cse5 (concat (select .cse29 .cse4) (select .cse29 c_ULTIMATE.start_main_~c~0.offset))))))) (= (_ bv0 32) c_ULTIMATE.start_main_~c~0.offset) (= .cse26 ((_ extract 31 0) .cse5)) (= (_ bv0 32) c_ULTIMATE.start_main_~a~0.offset) (let ((.cse36 (store .cse37 (bvadd .cse20 c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) (bvadd .cse30 .cse21))))) (let ((.cse31 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse36))) (let ((.cse33 (select .cse31 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse34 (bvadd (concat (select .cse33 .cse4) (select .cse33 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse36 .cse14) (select .cse36 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse35 ((_ extract 31 0) .cse34))) (let ((.cse32 (store .cse33 .cse12 .cse35))) (or (not (= (store .cse31 c_ULTIMATE.start_main_~c~0.base .cse32) (store .cse31 c_ULTIMATE.start_main_~c~0.base (store .cse33 .cse6 ((_ extract 63 32) .cse34))))) (= .cse8 (concat (select .cse32 .cse6) .cse35)) (not (= (concat (select .cse32 .cse4) (select .cse32 c_ULTIMATE.start_main_~c~0.offset)) .cse5))))))))) (let ((.cse43 (store .cse37 .cse17 ((_ extract 63 32) (bvadd .cse27 .cse1))))) (let ((.cse38 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse43))) (let ((.cse40 (select .cse38 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse41 (bvadd (concat (select .cse40 .cse4) (select .cse40 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse43 .cse14) (select .cse43 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse42 ((_ extract 31 0) .cse41))) (let ((.cse39 (store .cse40 .cse12 .cse42))) (or (not (= (store .cse38 c_ULTIMATE.start_main_~c~0.base .cse39) (store .cse38 c_ULTIMATE.start_main_~c~0.base (store .cse40 .cse6 ((_ extract 63 32) .cse41))))) (= (concat (select .cse39 .cse6) .cse42) .cse8) (not (= (concat (select .cse39 .cse4) (select .cse39 c_ULTIMATE.start_main_~c~0.offset)) .cse5))))))))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse46 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse47 ((_ extract 63 32) .cse46)) (.cse44 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse45 (concat .cse47 (select .cse44 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse44 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse45 .cse46))) (= .cse47 (select .cse44 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse48 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base))) (= (select .cse48 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse48 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse48 c_ULTIMATE.start_main_~b~0.offset)) .cse45))))))))) (not (= c_ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (= ((_ extract 63 32) .cse8) .cse49) (= ((_ extract 63 32) .cse2) .cse50) (= (_ bv1 32) c_ULTIMATE.start_main_~i~0))))) is different from true [2019-11-27 18:50:26,097 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-27 18:50:39,439 WARN L192 SmtUtils]: Spent 8.38 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-27 18:51:08,821 WARN L192 SmtUtils]: Spent 16.79 s on a formula simplification that was a NOOP. DAG size: 109 [2019-11-27 18:51:39,053 WARN L192 SmtUtils]: Spent 19.76 s on a formula simplification that was a NOOP. DAG size: 153 [2019-11-27 18:51:39,676 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-27 18:51:40,771 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2019-11-27 18:52:31,566 WARN L192 SmtUtils]: Spent 40.48 s on a formula simplification. DAG size of input: 180 DAG size of output: 111 [2019-11-27 18:52:34,264 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-27 18:52:37,306 WARN L192 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2019-11-27 18:52:43,737 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv8 32))) (.cse13 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base)) (.cse12 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse24 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base))) (let ((.cse16 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base)) (.cse0 (select .cse24 c_ULTIMATE.start_main_~c~0.offset)) (.cse23 (select .cse13 .cse12)) (.cse7 ((_ sign_extend 32) (_ bv1 32))) (.cse5 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse10 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse1 ((_ sign_extend 32) (_ bv0 32))) (.cse9 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) (.cse15 (concat (select .cse13 (bvadd .cse14 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967292 32))) (select .cse13 (bvadd .cse14 c_ULTIMATE.start_main_~b~0.offset (_ bv4294967288 32)))))) (and (= .cse0 ((_ extract 31 0) .cse1)) (let ((.cse11 (store .cse13 (bvadd .cse14 c_ULTIMATE.start_main_~b~0.offset (_ bv4 32)) ((_ extract 63 32) (bvadd .cse15 (concat (select .cse16 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse14 (_ bv4294967292 32))) (select .cse16 (bvadd c_ULTIMATE.start_main_~a~0.offset .cse14 (_ bv4294967288 32))))))))) (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse11))) (let ((.cse4 (select .cse2 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse6 (bvadd (concat (select .cse4 .cse9) (select .cse4 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse11 .cse12) (select .cse11 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse8 ((_ extract 31 0) .cse6))) (let ((.cse3 (store .cse4 .cse10 .cse8))) (or (not (= (store .cse2 c_ULTIMATE.start_main_~c~0.base .cse3) (store .cse2 c_ULTIMATE.start_main_~c~0.base (store .cse4 .cse5 ((_ extract 63 32) .cse6))))) (= .cse7 (concat (select .cse3 .cse5) .cse8)) (not (= (concat (select .cse3 .cse9) (select .cse3 c_ULTIMATE.start_main_~c~0.offset)) .cse1))))))))) (let ((.cse22 (store .cse13 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32)) ((_ extract 63 32) (bvadd (concat .cse23 (select .cse13 c_ULTIMATE.start_main_~b~0.offset)) (concat (select .cse16 (bvadd c_ULTIMATE.start_main_~a~0.offset (_ bv4 32))) (select .cse16 c_ULTIMATE.start_main_~a~0.offset))))))) (let ((.cse17 (store |c_#memory_int| c_ULTIMATE.start_main_~b~0.base .cse22))) (let ((.cse19 (select .cse17 c_ULTIMATE.start_main_~c~0.base))) (let ((.cse20 (bvadd (concat (select .cse19 .cse9) (select .cse19 c_ULTIMATE.start_main_~c~0.offset)) (concat (select .cse22 .cse12) (select .cse22 c_ULTIMATE.start_main_~b~0.offset))))) (let ((.cse21 ((_ extract 31 0) .cse20))) (let ((.cse18 (store .cse19 .cse10 .cse21))) (or (not (= (store .cse17 c_ULTIMATE.start_main_~c~0.base .cse18) (store .cse17 c_ULTIMATE.start_main_~c~0.base (store .cse19 .cse5 ((_ extract 63 32) .cse20))))) (= (concat (select .cse18 .cse5) .cse21) .cse7) (not (= (concat (select .cse18 .cse9) (select .cse18 c_ULTIMATE.start_main_~c~0.offset)) .cse1))))))))) (or (not (= .cse1 (concat (select .cse24 .cse9) .cse0))) (= (concat (select .cse24 .cse5) (select .cse24 .cse10)) .cse7)) (= (_ bv0 32) c_ULTIMATE.start_main_~b~0.offset) (not (= c_ULTIMATE.start_main_~c~0.base c_ULTIMATE.start_main_~b~0.base)) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse27 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse28 ((_ extract 63 32) .cse27)) (.cse25 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse26 (concat .cse28 (select .cse25 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse25 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse26 .cse27))) (= .cse28 (select .cse25 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~b~0.base)) (let ((.cse29 (select |c_#memory_int| c_ULTIMATE.start_main_~b~0.base))) (= (select .cse29 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse29 (bvadd c_ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse29 c_ULTIMATE.start_main_~b~0.offset)) .cse26))))))))) (= ((_ extract 63 32) .cse7) .cse23) (exists ((ULTIMATE.start_main_~b~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse37 (select |c_#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse34 ((_ sign_extend 32) (_ bv6 32))) (.cse35 (select .cse37 (_ bv4 32)))) (let ((.cse38 (concat .cse35 (select .cse37 (_ bv0 32)))) (.cse30 (select |c_#memory_int| c_ULTIMATE.start_main_~c~0.base)) (.cse36 ((_ extract 63 32) .cse34)) (.cse32 (select |c_#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse33 (concat .cse36 (select .cse32 (_ bv0 32)))) (.cse31 (bvadd .cse38 (concat (select .cse30 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv4 32))) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (and (not (= ULTIMATE.start_main_~a~0.base c_ULTIMATE.start_main_~c~0.base)) (= (select .cse30 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv8 32))) ((_ extract 31 0) .cse31)) (not (= c_ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base)) (= (select .cse32 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse33 .cse34))) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) .cse35) (= .cse36 (select .cse32 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select .cse37 (_ bv12 32)) ((_ extract 63 32) (bvadd .cse38 .cse33))) (= ((_ extract 63 32) .cse31) (select .cse30 (bvadd c_ULTIMATE.start_main_~c~0.offset (_ bv12 32)))))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~i~0) (let ((.cse39 (bvadd .cse15 (concat (select .cse24 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse14 (_ bv4294967292 32))) (select .cse24 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse14 (_ bv4294967288 32))))))) (let ((.cse40 (store .cse24 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse14) ((_ extract 31 0) .cse39)))) (or (not (= (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base (store .cse24 (bvadd c_ULTIMATE.start_main_~c~0.offset .cse14 (_ bv4 32)) ((_ extract 63 32) .cse39))) (store |c_#memory_int| c_ULTIMATE.start_main_~c~0.base .cse40))) (= .cse7 (concat (select .cse40 .cse5) (select .cse40 .cse10))) (not (= .cse1 (concat (select .cse40 .cse9) (select .cse40 c_ULTIMATE.start_main_~c~0.offset))))))) (= (_ bv0 32) c_ULTIMATE.start_main_~c~0.offset)))) is different from true [2019-11-27 18:52:49,480 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2019-11-27 18:53:00,040 WARN L192 SmtUtils]: Spent 9.14 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-27 18:53:00,578 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-27 18:53:12,424 WARN L192 SmtUtils]: Spent 10.04 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-27 18:53:14,273 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2019-11-27 18:53:15,317 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2019-11-27 18:53:35,369 WARN L192 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-27 18:53:36,358 WARN L192 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2019-11-27 18:53:43,674 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-11-27 18:53:44,389 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2019-11-27 18:53:44,867 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-11-27 18:53:47,714 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2019-11-27 18:53:49,351 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-11-27 18:53:52,332 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2019-11-27 18:53:53,942 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 72 [2019-11-27 18:53:59,378 WARN L192 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-11-27 18:54:06,601 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-27 18:54:07,475 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-27 18:54:14,628 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-27 18:54:23,307 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-27 18:54:24,491 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-27 18:54:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 18:54:28,514 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2019-11-27 18:54:28,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-27 18:54:28,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-11-27 18:54:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 18:54:28,533 INFO L225 Difference]: With dead ends: 94 [2019-11-27 18:54:28,533 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 18:54:28,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 333.9s TimeCoverageRelationStatistics Valid=539, Invalid=3856, Unknown=47, NotChecked=670, Total=5112 [2019-11-27 18:54:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 18:54:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 18:54:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 18:54:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 18:54:28,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-27 18:54:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 18:54:28,537 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 18:54:28,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-27 18:54:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 18:54:28,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 18:54:28,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 18:54:28,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 18:54:28,977 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 180 [2019-11-27 18:54:34,429 WARN L192 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 180 DAG size of output: 101 [2019-11-27 18:54:58,132 WARN L192 SmtUtils]: Spent 23.70 s on a formula simplification. DAG size of input: 143 DAG size of output: 118 [2019-11-27 18:55:00,038 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-11-27 18:55:17,220 WARN L192 SmtUtils]: Spent 17.18 s on a formula simplification. DAG size of input: 223 DAG size of output: 78 [2019-11-27 18:55:17,223 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 34) no Hoare annotation was computed. [2019-11-27 18:55:17,224 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 34) the Hoare annotation is: (let ((.cse13 (select |#memory_int| ULTIMATE.start_main_~c~0.base)) (.cse22 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse2 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse4 ((_ sign_extend 32) (_ bv6 32))) (.cse3 (select .cse2 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse18 ((_ sign_extend 32) (_ bv1 32))) (.cse21 (select .cse22 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (.cse19 (select .cse13 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv4 32)))) (.cse20 (select .cse13 ULTIMATE.start_main_~c~0.offset)) (.cse23 ((_ sign_extend 32) (_ bv0 32)))) (let ((.cse5 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse6 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base))) (.cse7 (not (= ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base))) (.cse12 (= (_ bv0 32) ULTIMATE.start_main_~c~0.offset)) (.cse0 (= .cse20 ((_ extract 31 0) .cse23))) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse8 (= .cse19 ((_ extract 63 32) .cse23))) (.cse9 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base))) (.cse10 (= ((_ extract 63 32) .cse18) .cse21)) (.cse11 (= ((_ extract 63 32) .cse4) .cse3))) (or (and .cse0 .cse1 (= (select .cse2 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd (concat .cse3 (select .cse2 ULTIMATE.start_main_~a~0.offset)) .cse4))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (bvsle ~N~0 (_ bv536870911 32)) .cse5 .cse6 .cse7 (let ((.cse15 (bvadd (concat .cse19 .cse20) (concat .cse21 (select .cse22 ULTIMATE.start_main_~b~0.offset))))) (let ((.cse17 ((_ extract 31 0) .cse15))) (let ((.cse16 (store .cse13 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv8 32)) .cse17)) (.cse14 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv12 32)))) (or (not (= (store |#memory_int| ULTIMATE.start_main_~c~0.base (store .cse13 .cse14 ((_ extract 63 32) .cse15))) (store |#memory_int| ULTIMATE.start_main_~c~0.base .cse16))) (= (concat (select .cse16 .cse14) .cse17) .cse18))))) .cse12 .cse0 .cse1 (not (bvsle ~N~0 (_ bv0 32))) .cse8 .cse9 .cse10 .cse11 (= (_ bv1 32) ULTIMATE.start_main_~i~0)))))) [2019-11-27 18:55:17,224 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 34) no Hoare annotation was computed. [2019-11-27 18:55:17,224 INFO L246 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-27 18:55:17,224 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 39) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L242 CegarLoopResult]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse31 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse13 (select |#memory_int| ULTIMATE.start_main_~c~0.base)) (.cse22 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse18 ((_ sign_extend 32) (_ bv1 32))) (.cse21 (select .cse22 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))) (.cse19 (select .cse13 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv4 32)))) (.cse20 (select .cse13 ULTIMATE.start_main_~c~0.offset)) (.cse23 ((_ sign_extend 32) (_ bv0 32))) (.cse30 (select .cse31 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse29 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse1 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse2 (= (select .cse31 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd (concat .cse30 (select .cse31 ULTIMATE.start_main_~a~0.offset)) .cse29)))) (.cse4 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base))) (.cse8 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base))) (.cse10 (= ((_ extract 63 32) .cse29) .cse30)) (.cse12 (= (_ bv1 32) ULTIMATE.start_main_~i~0)) (.cse0 (= .cse20 ((_ extract 31 0) .cse23))) (.cse3 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse5 (not (= ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base))) (.cse6 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse26 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse27 ((_ extract 63 32) .cse26)) (.cse24 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse25 (concat .cse27 (select .cse24 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base)) (= (select .cse24 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse25 .cse26))) (= .cse27 (select .cse24 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (let ((.cse28 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (= (select .cse28 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse28 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse28 ULTIMATE.start_main_~b~0.offset)) .cse25)))))))))) (.cse7 (= .cse19 ((_ extract 63 32) .cse23))) (.cse9 (= ((_ extract 63 32) .cse18) .cse21)) (.cse11 (= (_ bv0 32) ULTIMATE.start_main_~c~0.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 (not (bvslt (_ bv1 32) ~N~0)) (not (bvsle ~N~0 (_ bv0 32))) .cse7 .cse12 .cse11) (and .cse0 .cse3 .cse5 .cse6 .cse7 .cse9 (let ((.cse15 (bvadd (concat .cse19 .cse20) (concat .cse21 (select .cse22 ULTIMATE.start_main_~b~0.offset))))) (let ((.cse17 ((_ extract 31 0) .cse15))) (let ((.cse16 (store .cse13 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv8 32)) .cse17)) (.cse14 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv12 32)))) (or (not (= (store |#memory_int| ULTIMATE.start_main_~c~0.base (store .cse13 .cse14 ((_ extract 63 32) .cse15))) (store |#memory_int| ULTIMATE.start_main_~c~0.base .cse16))) (= (concat (select .cse16 .cse14) .cse17) .cse18))))) .cse11))))) [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point L36-4(lines 36 39) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-27 18:55:17,225 INFO L246 CegarLoopResult]: For program point L41-2(lines 41 44) no Hoare annotation was computed. [2019-11-27 18:55:17,226 INFO L242 CegarLoopResult]: At program point L41-3(lines 41 44) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_~a~0.base)) (.cse21 (select |#memory_int| ULTIMATE.start_main_~b~0.base)) (.cse20 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (.cse11 (select |#memory_int| ULTIMATE.start_main_~c~0.base)) (.cse18 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv4 32)))) (let ((.cse24 (select .cse11 .cse18)) (.cse25 (select .cse11 ULTIMATE.start_main_~c~0.offset)) (.cse27 ((_ sign_extend 32) (_ bv0 32))) (.cse14 ((_ sign_extend 32) (_ bv1 32))) (.cse26 (select .cse21 .cse20)) (.cse9 (select .cse1 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32))))) (let ((.cse2 (concat .cse9 (select .cse1 ULTIMATE.start_main_~a~0.offset))) (.cse4 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse5 (not (= ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base))) (.cse12 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (.cse13 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv8 32))) (.cse6 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse30 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse31 ((_ extract 63 32) .cse30)) (.cse28 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse29 (concat .cse31 (select .cse28 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base)) (= (select .cse28 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse29 .cse30))) (= .cse31 (select .cse28 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (let ((.cse32 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (= (select .cse32 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse32 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse32 ULTIMATE.start_main_~b~0.offset)) .cse29)))))))))) (.cse8 (= ((_ extract 63 32) .cse14) .cse26)) (.cse0 (= .cse25 ((_ extract 31 0) .cse27))) (.cse7 (= .cse24 ((_ extract 63 32) .cse27))) (.cse10 (= (_ bv0 32) ULTIMATE.start_main_~c~0.offset))) (or (let ((.cse3 ((_ sign_extend 32) (_ bv6 32)))) (and .cse0 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= (select .cse1 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd .cse2 .cse3))) .cse4 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) .cse8 (= ((_ extract 63 32) .cse3) .cse9) .cse10)) (and .cse0 .cse7 (= (concat (select .cse11 .cse12) (select .cse11 .cse13)) .cse14) .cse10) (let ((.cse22 (concat .cse26 (select .cse21 ULTIMATE.start_main_~b~0.offset)))) (and (not (let ((.cse19 (store .cse21 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32)) ((_ extract 63 32) (bvadd .cse22 .cse2))))) (let ((.cse15 (store |#memory_int| ULTIMATE.start_main_~b~0.base .cse19))) (let ((.cse16 (select .cse15 ULTIMATE.start_main_~c~0.base))) (let ((.cse17 (bvadd (concat (select .cse16 .cse18) (select .cse16 ULTIMATE.start_main_~c~0.offset)) (concat (select .cse19 .cse20) (select .cse19 ULTIMATE.start_main_~b~0.offset))))) (= (store .cse15 ULTIMATE.start_main_~c~0.base (store .cse16 .cse13 ((_ extract 31 0) .cse17))) (store .cse15 ULTIMATE.start_main_~c~0.base (store .cse16 .cse12 ((_ extract 63 32) .cse17))))))))) .cse0 .cse4 .cse5 (not (let ((.cse23 (bvadd (concat .cse24 .cse25) .cse22))) (= (store |#memory_int| ULTIMATE.start_main_~c~0.base (store .cse11 .cse12 ((_ extract 63 32) .cse23))) (store |#memory_int| ULTIMATE.start_main_~c~0.base (store .cse11 .cse13 ((_ extract 31 0) .cse23)))))) .cse6 .cse7 .cse8 (= (_ bv1 32) ULTIMATE.start_main_~i~0) .cse10)) (and .cse0 (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse7 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0)) .cse10))))) [2019-11-27 18:55:17,226 INFO L246 CegarLoopResult]: For program point L41-4(lines 41 44) no Hoare annotation was computed. [2019-11-27 18:55:17,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 18:55:17,226 INFO L249 CegarLoopResult]: At program point L50(lines 16 51) the Hoare annotation is: true [2019-11-27 18:55:17,226 INFO L246 CegarLoopResult]: For program point L46-2(lines 46 49) no Hoare annotation was computed. [2019-11-27 18:55:17,227 INFO L242 CegarLoopResult]: At program point L46-3(lines 46 49) the Hoare annotation is: (let ((.cse28 (select |#memory_int| ULTIMATE.start_main_~c~0.base)) (.cse27 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse17 (select .cse27 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv4 32)))) (.cse16 ((_ sign_extend 32) (_ bv6 32))) (.cse20 ((_ sign_extend 32) (_ bv0 32))) (.cse19 (select .cse28 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv4 32)))) (.cse26 (select .cse28 ULTIMATE.start_main_~c~0.offset)) (.cse18 ((_ sign_extend 32) (_ bv1 32)))) (let ((.cse1 (or (not (= .cse20 (concat .cse19 .cse26))) (= (concat (select .cse28 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv12 32))) (select .cse28 (bvadd ULTIMATE.start_main_~c~0.offset (_ bv8 32)))) .cse18))) (.cse5 (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (.cse7 (= (select .cse27 (bvadd ULTIMATE.start_main_~a~0.offset (_ bv8 32))) ((_ extract 31 0) (bvadd (concat .cse17 (select .cse27 ULTIMATE.start_main_~a~0.offset)) .cse16)))) (.cse8 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse9 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base))) (.cse10 (not (= ULTIMATE.start_main_~c~0.base ULTIMATE.start_main_~b~0.base))) (.cse4 (= (_ bv0 32) ULTIMATE.start_main_~c~0.offset)) (.cse0 (= .cse26 ((_ extract 31 0) .cse20))) (.cse11 (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset)) (.cse2 (= (_ bv0 32) ULTIMATE.start_main_~i~0)) (.cse12 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) (_ bv6 32)))) (let ((.cse24 ((_ extract 63 32) .cse23)) (.cse21 (select |#memory_int| ULTIMATE.start_main_~a~0.base))) (let ((.cse22 (concat .cse24 (select .cse21 (_ bv0 32))))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~c~0.base)) (= (select .cse21 (_ bv8 32)) ((_ extract 31 0) (bvadd .cse22 .cse23))) (= .cse24 (select .cse21 (_ bv4 32))) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (let ((.cse25 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (= (select .cse25 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv12 32))) ((_ extract 63 32) (bvadd (concat (select .cse25 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))) (select .cse25 ULTIMATE.start_main_~b~0.offset)) .cse22)))))))))) (.cse3 (= .cse19 ((_ extract 63 32) .cse20))) (.cse13 (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base))) (.cse14 (= ((_ extract 63 32) .cse18) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32))))) (.cse15 (= ((_ extract 63 32) .cse16) .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse5 .cse6 .cse4 .cse11 .cse0 .cse12 .cse3 .cse13 .cse14 .cse15) (and .cse0 (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 (not (bvslt (bvadd ULTIMATE.start_main_~i~0 (_ bv1 32)) ~N~0)) .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse4 .cse0 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse15))))) [2019-11-27 18:55:17,227 INFO L246 CegarLoopResult]: For program point L46-4(lines 46 49) no Hoare annotation was computed. [2019-11-27 18:55:17,227 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-27 18:55:17,227 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-27 18:55:17,227 INFO L246 CegarLoopResult]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-27 18:55:17,233 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-27 18:55:17,238 INFO L168 Benchmark]: Toolchain (without parser) took 491915.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 955.0 MB in the beginning and 916.0 MB in the end (delta: 39.0 MB). Peak memory consumption was 249.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:55:17,238 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:55:17,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 18:55:17,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:55:17,240 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 18:55:17,241 INFO L168 Benchmark]: RCFGBuilder took 444.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 18:55:17,242 INFO L168 Benchmark]: TraceAbstraction took 491038.79 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 916.0 MB in the end (delta: 162.9 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-11-27 18:55:17,248 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 444.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 491038.79 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 916.0 MB in the end (delta: 162.9 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...