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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:04:06,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:04:06,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:04:06,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:04:06,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:04:06,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:04:06,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:04:06,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:04:06,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:04:06,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:04:06,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:04:06,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:04:06,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:04:06,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:04:06,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:04:06,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:04:06,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:04:06,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:04:06,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:04:06,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:04:06,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:04:06,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:04:06,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:04:06,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:04:06,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:04:06,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:04:06,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:04:06,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:04:06,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:04:06,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:04:06,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:04:06,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:04:06,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:04:06,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:04:06,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:04:06,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:04:06,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:04:06,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:04:06,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:04:06,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:04:06,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:04:06,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:04:06,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:04:06,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:04:06,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:04:06,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:04:06,687 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:04:06,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:04:06,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:04:06,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:04:06,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:04:06,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:04:06,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:04:06,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:04:06,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:04:06,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:04:06,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:04:06,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:04:06,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:04:06,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:04:06,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:04:06,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:04:06,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:04:06,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:04:06,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:04:06,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:04:06,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:04:06,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:04:06,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:04:06,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:04:06,958 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:04:06,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label15.c [2019-10-13 20:04:07,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ba2183/735bd8338a3345bda93f8292922e219f/FLAGbb8a63fca [2019-10-13 20:04:07,697 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:04:07,700 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label15.c [2019-10-13 20:04:07,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ba2183/735bd8338a3345bda93f8292922e219f/FLAGbb8a63fca [2019-10-13 20:04:07,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63ba2183/735bd8338a3345bda93f8292922e219f [2019-10-13 20:04:07,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:04:07,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:04:07,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:04:07,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:04:07,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:04:07,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:07" (1/1) ... [2019-10-13 20:04:07,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4924bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:07, skipping insertion in model container [2019-10-13 20:04:07,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:04:07" (1/1) ... [2019-10-13 20:04:07,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:04:07,953 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:04:08,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:04:08,549 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:04:08,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:04:08,829 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:04:08,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08 WrapperNode [2019-10-13 20:04:08,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:04:08,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:04:08,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:04:08,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:04:08,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:08,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... [2019-10-13 20:04:09,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:04:09,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:04:09,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:04:09,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:04:09,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:04:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:04:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:04:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 20:04:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:04:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 20:04:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:04:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:04:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:04:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:04:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:04:09,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:04:10,788 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:04:10,789 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:04:10,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:10 BoogieIcfgContainer [2019-10-13 20:04:10,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:04:10,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:04:10,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:04:10,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:04:10,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:04:07" (1/3) ... [2019-10-13 20:04:10,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cda1f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:10, skipping insertion in model container [2019-10-13 20:04:10,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:04:08" (2/3) ... [2019-10-13 20:04:10,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cda1f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:04:10, skipping insertion in model container [2019-10-13 20:04:10,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:04:10" (3/3) ... [2019-10-13 20:04:10,813 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label15.c [2019-10-13 20:04:10,824 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:04:10,834 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:04:10,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:04:10,897 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:04:10,897 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:04:10,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:04:10,899 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:04:10,899 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:04:10,900 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:04:10,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:04:10,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:04:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-13 20:04:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:04:10,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:10,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:10,966 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:10,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1453317925, now seen corresponding path program 1 times [2019-10-13 20:04:10,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:10,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389679064] [2019-10-13 20:04:10,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:10,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:10,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:11,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389679064] [2019-10-13 20:04:11,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:11,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:04:11,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956038884] [2019-10-13 20:04:11,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:04:11,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:04:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:11,249 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-13 20:04:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:13,337 INFO L93 Difference]: Finished difference Result 981 states and 1757 transitions. [2019-10-13 20:04:13,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:04:13,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 20:04:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:13,361 INFO L225 Difference]: With dead ends: 981 [2019-10-13 20:04:13,361 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 20:04:13,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 20:04:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-10-13 20:04:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-13 20:04:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 880 transitions. [2019-10-13 20:04:13,460 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 880 transitions. Word has length 20 [2019-10-13 20:04:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:13,460 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 880 transitions. [2019-10-13 20:04:13,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:04:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 880 transitions. [2019-10-13 20:04:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 20:04:13,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:13,467 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:13,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1546422986, now seen corresponding path program 1 times [2019-10-13 20:04:13,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:13,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355467277] [2019-10-13 20:04:13,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:13,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:13,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355467277] [2019-10-13 20:04:13,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:13,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:04:13,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785781895] [2019-10-13 20:04:13,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:04:13,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:04:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:04:13,785 INFO L87 Difference]: Start difference. First operand 622 states and 880 transitions. Second operand 6 states. [2019-10-13 20:04:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:15,665 INFO L93 Difference]: Finished difference Result 1837 states and 2643 transitions. [2019-10-13 20:04:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:04:15,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-13 20:04:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:15,675 INFO L225 Difference]: With dead ends: 1837 [2019-10-13 20:04:15,676 INFO L226 Difference]: Without dead ends: 1221 [2019-10-13 20:04:15,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:04:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-10-13 20:04:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1210. [2019-10-13 20:04:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-13 20:04:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1600 transitions. [2019-10-13 20:04:15,740 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1600 transitions. Word has length 100 [2019-10-13 20:04:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:15,741 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1600 transitions. [2019-10-13 20:04:15,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:04:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1600 transitions. [2019-10-13 20:04:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 20:04:15,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:15,749 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:04:15,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1386273764, now seen corresponding path program 1 times [2019-10-13 20:04:15,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:15,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226146533] [2019-10-13 20:04:15,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:15,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:15,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:15,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226146533] [2019-10-13 20:04:15,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:04:15,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:04:15,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519620781] [2019-10-13 20:04:15,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:04:15,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:04:15,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:15,919 INFO L87 Difference]: Start difference. First operand 1210 states and 1600 transitions. Second operand 4 states. [2019-10-13 20:04:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:18,008 INFO L93 Difference]: Finished difference Result 4723 states and 6446 transitions. [2019-10-13 20:04:18,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:04:18,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-13 20:04:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:18,037 INFO L225 Difference]: With dead ends: 4723 [2019-10-13 20:04:18,037 INFO L226 Difference]: Without dead ends: 3519 [2019-10-13 20:04:18,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:04:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2019-10-13 20:04:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3118. [2019-10-13 20:04:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-10-13 20:04:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4067 transitions. [2019-10-13 20:04:18,181 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4067 transitions. Word has length 151 [2019-10-13 20:04:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:18,184 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 4067 transitions. [2019-10-13 20:04:18,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:04:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4067 transitions. [2019-10-13 20:04:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-13 20:04:18,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:18,196 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 20:04:18,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 782773517, now seen corresponding path program 1 times [2019-10-13 20:04:18,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:18,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232764367] [2019-10-13 20:04:18,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:18,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:18,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:04:18,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232764367] [2019-10-13 20:04:18,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100846370] [2019-10-13 20:04:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:04:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:18,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 20:04:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:04:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 20:04:18,743 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:04:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:04:18,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:04:18,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 20:04:18,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661196018] [2019-10-13 20:04:18,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:04:18,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:04:18,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:04:18,866 INFO L87 Difference]: Start difference. First operand 3118 states and 4067 transitions. Second operand 5 states. [2019-10-13 20:04:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:20,698 INFO L93 Difference]: Finished difference Result 7090 states and 9733 transitions. [2019-10-13 20:04:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:04:20,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-13 20:04:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:20,722 INFO L225 Difference]: With dead ends: 7090 [2019-10-13 20:04:20,723 INFO L226 Difference]: Without dead ends: 4166 [2019-10-13 20:04:20,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:04:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-10-13 20:04:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 3552. [2019-10-13 20:04:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2019-10-13 20:04:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4682 transitions. [2019-10-13 20:04:20,841 INFO L78 Accepts]: Start accepts. Automaton has 3552 states and 4682 transitions. Word has length 186 [2019-10-13 20:04:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:20,842 INFO L462 AbstractCegarLoop]: Abstraction has 3552 states and 4682 transitions. [2019-10-13 20:04:20,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:04:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3552 states and 4682 transitions. [2019-10-13 20:04:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-13 20:04:20,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:20,846 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:04:21,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:04:21,052 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2027682720, now seen corresponding path program 1 times [2019-10-13 20:04:21,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:21,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859182251] [2019-10-13 20:04:21,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:21,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:21,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 20:04:21,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859182251] [2019-10-13 20:04:21,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515147792] [2019-10-13 20:04:21,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:04:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:21,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 20:04:21,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:04:21,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 20:04:21,628 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:04:21,830 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-10-13 20:04:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 26 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:04:22,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:04:22,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 5] total 14 [2019-10-13 20:04:22,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008842739] [2019-10-13 20:04:22,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:04:22,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:04:22,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:04:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:04:22,070 INFO L87 Difference]: Start difference. First operand 3552 states and 4682 transitions. Second operand 5 states. [2019-10-13 20:04:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:04:23,663 INFO L93 Difference]: Finished difference Result 7353 states and 9767 transitions. [2019-10-13 20:04:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:04:23,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-10-13 20:04:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:04:23,682 INFO L225 Difference]: With dead ends: 7353 [2019-10-13 20:04:23,683 INFO L226 Difference]: Without dead ends: 3807 [2019-10-13 20:04:23,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-10-13 20:04:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-10-13 20:04:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 3786. [2019-10-13 20:04:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-10-13 20:04:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5003 transitions. [2019-10-13 20:04:23,803 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5003 transitions. Word has length 187 [2019-10-13 20:04:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:04:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 3786 states and 5003 transitions. [2019-10-13 20:04:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:04:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5003 transitions. [2019-10-13 20:04:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-13 20:04:23,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:04:23,809 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 20:04:24,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:04:24,020 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:04:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:04:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1231270553, now seen corresponding path program 1 times [2019-10-13 20:04:24,021 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:04:24,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427867783] [2019-10-13 20:04:24,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:24,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:04:24,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:04:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 108 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:24,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427867783] [2019-10-13 20:04:24,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895147840] [2019-10-13 20:04:24,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:04:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:04:24,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 20:04:24,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:04:24,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:24,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,078 WARN L191 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-10-13 20:04:32,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:32,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:32,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:34,496 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-10-13 20:04:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:04:34,766 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:04:34,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 20:04:34,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,035 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-13 20:04:35,215 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-10-13 20:04:35,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,666 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 37 [2019-10-13 20:04:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:04:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:04:35,820 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13