java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_m5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:26:39,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:26:39,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:26:39,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:26:39,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:26:39,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:26:39,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:26:39,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:26:39,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:26:39,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:26:39,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:26:39,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:26:39,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:26:39,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:26:39,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:26:39,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:26:39,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:26:39,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:26:39,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:26:39,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:26:39,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:26:39,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:26:39,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:26:39,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:26:39,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:26:39,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:26:39,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:26:39,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:26:39,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:26:39,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:26:39,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:26:39,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:26:39,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:26:39,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:26:39,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:26:39,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:26:39,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:26:39,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:26:39,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:26:39,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:26:39,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:26:39,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 12:26:39,980 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:26:39,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:26:39,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:26:39,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:26:39,983 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:26:39,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:26:39,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:26:39,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:26:39,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:26:39,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:26:39,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:26:39,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:26:39,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:26:39,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:26:39,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:26:39,986 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:26:39,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:26:39,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:26:39,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:26:39,987 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:26:39,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:26:39,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:26:39,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:26:39,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:26:39,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:26:39,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:26:39,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:26:39,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:26:39,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:26:40,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:26:40,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:26:40,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:26:40,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:26:40,047 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:26:40,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_m5.c [2019-09-07 12:26:40,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c105e6f8/e541d18ca5d5493091f66bea03017c73/FLAG00e9c576d [2019-09-07 12:26:40,528 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:26:40,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_m5.c [2019-09-07 12:26:40,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c105e6f8/e541d18ca5d5493091f66bea03017c73/FLAG00e9c576d [2019-09-07 12:26:40,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c105e6f8/e541d18ca5d5493091f66bea03017c73 [2019-09-07 12:26:40,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:26:40,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:26:40,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:26:40,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:26:40,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:26:40,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:26:40" (1/1) ... [2019-09-07 12:26:40,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335c662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:40, skipping insertion in model container [2019-09-07 12:26:40,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:26:40" (1/1) ... [2019-09-07 12:26:40,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:26:41,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:26:41,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:26:41,195 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:26:41,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:26:41,343 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:26:41,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41 WrapperNode [2019-09-07 12:26:41,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:26:41,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:26:41,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:26:41,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:26:41,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (1/1) ... [2019-09-07 12:26:41,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:26:41,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:26:41,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:26:41,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:26:41,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (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-09-07 12:26:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:26:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:26:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 12:26:41,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:26:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 12:26:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 12:26:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 12:26:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:26:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:26:41,812 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:26:41,813 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-07 12:26:41,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:26:41 BoogieIcfgContainer [2019-09-07 12:26:41,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:26:41,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:26:41,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:26:41,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:26:41,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:26:40" (1/3) ... [2019-09-07 12:26:41,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb6feff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:26:41, skipping insertion in model container [2019-09-07 12:26:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:26:41" (2/3) ... [2019-09-07 12:26:41,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb6feff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:26:41, skipping insertion in model container [2019-09-07 12:26:41,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:26:41" (3/3) ... [2019-09-07 12:26:41,821 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_m5.c [2019-09-07 12:26:41,830 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:26:41,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:26:41,855 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:26:41,891 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:26:41,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:26:41,892 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:26:41,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:26:41,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:26:41,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:26:41,892 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:26:41,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:26:41,892 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:26:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-09-07 12:26:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 12:26:41,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:41,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:41,917 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash -298961335, now seen corresponding path program 1 times [2019-09-07 12:26:41,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:26:42,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:26:42,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 12:26:42,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 12:26:42,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 12:26:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:26:42,081 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-09-07 12:26:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:42,107 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2019-09-07 12:26:42,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 12:26:42,108 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 12:26:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:42,120 INFO L225 Difference]: With dead ends: 95 [2019-09-07 12:26:42,120 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 12:26:42,124 INFO L628 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-09-07 12:26:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 12:26:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-09-07 12:26:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 12:26:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-09-07 12:26:42,171 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2019-09-07 12:26:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:42,172 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-09-07 12:26:42,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 12:26:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-09-07 12:26:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 12:26:42,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:42,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:42,176 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash 351831333, now seen corresponding path program 1 times [2019-09-07 12:26:42,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:42,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:42,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:26:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:26:42,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 12:26:42,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:26:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:26:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:26:42,325 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2019-09-07 12:26:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:42,442 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-09-07 12:26:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:26:42,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-07 12:26:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:42,445 INFO L225 Difference]: With dead ends: 68 [2019-09-07 12:26:42,445 INFO L226 Difference]: Without dead ends: 63 [2019-09-07 12:26:42,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:26:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-07 12:26:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-07 12:26:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 12:26:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2019-09-07 12:26:42,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 32 [2019-09-07 12:26:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:42,459 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2019-09-07 12:26:42,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:26:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2019-09-07 12:26:42,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 12:26:42,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:42,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:42,462 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:42,462 INFO L82 PathProgramCache]: Analyzing trace with hash 615337315, now seen corresponding path program 1 times [2019-09-07 12:26:42,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:42,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 12:26:42,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:26:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:26:42,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:26:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:26:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:26:42,532 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 3 states. [2019-09-07 12:26:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:42,598 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2019-09-07 12:26:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:26:42,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 12:26:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:42,600 INFO L225 Difference]: With dead ends: 119 [2019-09-07 12:26:42,601 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 12:26:42,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:26:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 12:26:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-07 12:26:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 12:26:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-09-07 12:26:42,612 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 34 [2019-09-07 12:26:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:42,612 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-09-07 12:26:42,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:26:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-09-07 12:26:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 12:26:42,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:42,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:42,615 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1838268449, now seen corresponding path program 1 times [2019-09-07 12:26:42,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:42,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:42,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 12:26:42,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:26:42,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 12:26:42,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:26:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:26:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:26:42,681 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 4 states. [2019-09-07 12:26:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:42,857 INFO L93 Difference]: Finished difference Result 114 states and 150 transitions. [2019-09-07 12:26:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:26:42,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-09-07 12:26:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:42,859 INFO L225 Difference]: With dead ends: 114 [2019-09-07 12:26:42,859 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 12:26:42,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:26:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 12:26:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-09-07 12:26:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 12:26:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2019-09-07 12:26:42,870 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 36 [2019-09-07 12:26:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:42,870 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2019-09-07 12:26:42,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:26:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2019-09-07 12:26:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 12:26:42,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:42,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:42,873 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1356508047, now seen corresponding path program 1 times [2019-09-07 12:26:42,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:42,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:26:42,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:26:42,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:26:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:26:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:43,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:26:43,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:26:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 12:26:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:26:43,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 12:26:43,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:26:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:26:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:26:43,113 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2019-09-07 12:26:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:43,204 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2019-09-07 12:26:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:26:43,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-07 12:26:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:43,206 INFO L225 Difference]: With dead ends: 103 [2019-09-07 12:26:43,206 INFO L226 Difference]: Without dead ends: 58 [2019-09-07 12:26:43,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:26:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-07 12:26:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-07 12:26:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-07 12:26:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2019-09-07 12:26:43,223 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 54 [2019-09-07 12:26:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:43,223 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2019-09-07 12:26:43,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:26:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2019-09-07 12:26:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 12:26:43,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:43,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:43,227 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1231531187, now seen corresponding path program 2 times [2019-09-07 12:26:43,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:43,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:43,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:26:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 12:26:43,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:26:43,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:26:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:26:43,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:26:43,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:26:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:26:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:26:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 12:26:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:26:43,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 12:26:43,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:26:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:26:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:26:43,470 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 7 states. [2019-09-07 12:26:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:26:43,684 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2019-09-07 12:26:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:26:43,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-07 12:26:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:26:43,686 INFO L225 Difference]: With dead ends: 128 [2019-09-07 12:26:43,686 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 12:26:43,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:26:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 12:26:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2019-09-07 12:26:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 12:26:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-09-07 12:26:43,696 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 56 [2019-09-07 12:26:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:26:43,696 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-09-07 12:26:43,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:26:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-09-07 12:26:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 12:26:43,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:26:43,698 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:26:43,698 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:26:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:26:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1043072633, now seen corresponding path program 3 times [2019-09-07 12:26:43,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:26:43,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:26:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:43,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:26:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:26:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:26:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:26:47,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:26:47,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:26:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:26:47,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 12:26:47,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:26:47,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-07 12:26:47,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:26:47,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 12:26:47,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 12:26:47,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:26:47,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 12:26:47,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2019-09-07 12:27:03,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:27:03,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2019-09-07 12:27:03,905 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-07 12:27:03,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 12:27:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:27:03,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 12:27:03,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2019-09-07 12:27:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:27:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:27:04,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:27:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:27:04,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:27:04,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 58] total 97 [2019-09-07 12:27:04,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-07 12:27:04,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-07 12:27:04,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=8831, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 12:27:04,542 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 97 states. [2019-09-07 12:27:08,122 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 56 [2019-09-07 12:27:08,718 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 44 [2019-09-07 12:27:46,109 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2019-09-07 12:27:51,038 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2019-09-07 12:28:04,106 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 70 [2019-09-07 12:28:08,295 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2019-09-07 12:28:37,714 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-07 12:29:31,156 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-07 12:29:52,950 WARN L188 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 72 [2019-09-07 12:30:24,940 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2019-09-07 12:31:37,229 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 12:34:02,798 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-07 12:35:53,858 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 84 [2019-09-07 12:37:15,845 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-09-07 12:38:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:38:26,965 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2019-09-07 12:38:26,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-07 12:38:26,966 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 76 [2019-09-07 12:38:26,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:38:26,969 INFO L225 Difference]: With dead ends: 220 [2019-09-07 12:38:26,969 INFO L226 Difference]: Without dead ends: 214 [2019-09-07 12:38:26,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 17 SyntacticMatches, 13 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7655 ImplicationChecksByTransitivity, 351.6s TimeCoverageRelationStatistics Valid=1028, Invalid=22822, Unknown=20, NotChecked=0, Total=23870 [2019-09-07 12:38:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-07 12:38:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2019-09-07 12:38:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 12:38:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2019-09-07 12:38:26,995 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 76 [2019-09-07 12:38:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:38:26,996 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2019-09-07 12:38:26,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-07 12:38:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2019-09-07 12:38:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 12:38:26,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:38:26,998 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:38:26,999 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:38:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:38:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 867658167, now seen corresponding path program 4 times [2019-09-07 12:38:26,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:38:26,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:38:27,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:27,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:38:27,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:38:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 12:38:27,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:38:27,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:38:27,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:38:27,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:38:27,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:38:27,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:38:27,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:38:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:38:27,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:38:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-07 12:38:27,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 12:38:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 12:38:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:38:27,264 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. Second operand 16 states. [2019-09-07 12:38:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:38:28,559 INFO L93 Difference]: Finished difference Result 275 states and 322 transitions. [2019-09-07 12:38:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 12:38:28,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-09-07 12:38:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:38:28,562 INFO L225 Difference]: With dead ends: 275 [2019-09-07 12:38:28,563 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 12:38:28,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-09-07 12:38:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 12:38:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2019-09-07 12:38:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 12:38:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2019-09-07 12:38:28,583 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 78 [2019-09-07 12:38:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:38:28,583 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2019-09-07 12:38:28,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 12:38:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2019-09-07 12:38:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 12:38:28,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:38:28,586 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:38:28,586 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:38:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:38:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2092345077, now seen corresponding path program 5 times [2019-09-07 12:38:28,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:38:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:38:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:28,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:38:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:38:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-07 12:38:28,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:38:28,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:38:28,697 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:38:28,859 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 12:38:28,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:38:28,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:38:28,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:38:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:38:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:38:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-07 12:38:28,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 12:38:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 12:38:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:38:28,964 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 16 states. [2019-09-07 12:38:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:38:29,546 INFO L93 Difference]: Finished difference Result 223 states and 249 transitions. [2019-09-07 12:38:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:38:29,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2019-09-07 12:38:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:38:29,547 INFO L225 Difference]: With dead ends: 223 [2019-09-07 12:38:29,547 INFO L226 Difference]: Without dead ends: 109 [2019-09-07 12:38:29,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:38:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-07 12:38:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-09-07 12:38:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 12:38:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-09-07 12:38:29,574 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 80 [2019-09-07 12:38:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:38:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-09-07 12:38:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 12:38:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-09-07 12:38:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 12:38:29,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:38:29,576 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:38:29,577 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:38:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:38:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1937623581, now seen corresponding path program 6 times [2019-09-07 12:38:29,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:38:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:38:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:29,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:38:29,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:38:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:38:30,606 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 12 [2019-09-07 12:38:30,750 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 12 [2019-09-07 12:38:30,947 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 15 [2019-09-07 12:38:31,158 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2019-09-07 12:38:31,391 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-09-07 12:38:31,657 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-09-07 12:38:31,873 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2019-09-07 12:38:32,098 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2019-09-07 12:38:32,352 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2019-09-07 12:38:32,592 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2019-09-07 12:38:32,840 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-09-07 12:38:33,113 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-09-07 12:38:33,342 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-07 12:38:33,545 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2019-09-07 12:38:33,797 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2019-09-07 12:38:34,030 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2019-09-07 12:38:34,286 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-07 12:38:34,569 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-09-07 12:38:34,789 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 35 [2019-09-07 12:38:34,989 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2019-09-07 12:38:35,225 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2019-09-07 12:38:35,474 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-09-07 12:38:35,725 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-07 12:38:35,969 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-09-07 12:38:36,204 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2019-09-07 12:38:36,427 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-09-07 12:38:36,664 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2019-09-07 12:38:36,904 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 36 [2019-09-07 12:38:37,152 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-09-07 12:38:37,404 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-09-07 12:38:37,627 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-07 12:38:37,838 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-09-07 12:38:38,087 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-07 12:38:38,388 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2019-09-07 12:38:38,647 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-09-07 12:38:38,904 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-07 12:38:39,131 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-07 12:38:39,418 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-07 12:38:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:38:43,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:38:43,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:38:43,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:38:43,375 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-07 12:38:43,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:38:43,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-07 12:38:43,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:39:05,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,517 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,520 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 12:39:05,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 12:39:05,748 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-09-07 12:39:05,751 INFO L341 Elim1Store]: treesize reduction 18, result has 90.6 percent of original size [2019-09-07 12:39:05,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 80 treesize of output 191 [2019-09-07 12:39:05,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:05,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,089 INFO L496 ElimStorePlain]: Start of recursive call 2: 40 dim-0 vars, End of recursive call: 42 dim-0 vars, and 3 xjuncts. [2019-09-07 12:39:06,412 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 35 [2019-09-07 12:39:06,413 INFO L567 ElimStorePlain]: treesize reduction 2058, result has 2.6 percent of original size [2019-09-07 12:39:06,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-07 12:39:06,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:116, output treesize:35 [2019-09-07 12:39:06,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:07,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 12:39:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 12:39:07,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:39:07,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 77] total 140 [2019-09-07 12:39:07,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-07 12:39:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-07 12:39:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=18903, Unknown=0, NotChecked=0, Total=19460 [2019-09-07 12:39:07,505 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 140 states. [2019-09-07 12:39:14,657 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 87 [2019-09-07 12:39:17,833 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 104 [2019-09-07 12:39:25,005 WARN L188 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 80 [2019-09-07 12:39:45,931 WARN L188 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 315 DAG size of output: 96 [2019-09-07 12:40:07,397 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-09-07 12:40:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 12:40:07,399 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. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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:1428) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:631) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2019-09-07 12:40:07,404 INFO L168 Benchmark]: Toolchain (without parser) took 806431.38 ms. Allocated memory was 140.5 MB in the beginning and 195.0 MB in the end (delta: 54.5 MB). Free memory was 88.3 MB in the beginning and 138.5 MB in the end (delta: -50.3 MB). Peak memory consumption was 85.8 MB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,405 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.82 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 88.1 MB in the beginning and 177.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,408 INFO L168 Benchmark]: Boogie Preprocessor took 48.71 ms. Allocated memory is still 199.8 MB. Free memory was 177.5 MB in the beginning and 175.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,408 INFO L168 Benchmark]: RCFGBuilder took 420.27 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 154.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,409 INFO L168 Benchmark]: TraceAbstraction took 805587.41 ms. Allocated memory was 199.8 MB in the beginning and 195.0 MB in the end (delta: -4.7 MB). Free memory was 154.2 MB in the beginning and 138.5 MB in the end (delta: 15.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-09-07 12:40:07,416 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.82 ms. Allocated memory was 140.5 MB in the beginning and 199.8 MB in the end (delta: 59.2 MB). Free memory was 88.1 MB in the beginning and 177.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.71 ms. Allocated memory is still 199.8 MB. Free memory was 177.5 MB in the beginning and 175.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.27 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 154.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 805587.41 ms. Allocated memory was 199.8 MB in the beginning and 195.0 MB in the end (delta: -4.7 MB). Free memory was 154.2 MB in the beginning and 138.5 MB in the end (delta: 15.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 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. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : 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...