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-examples/sanfoundry_10_ground.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:28:19,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:28:19,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:28:19,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:28:19,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:28:19,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:28:19,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:28:19,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:28:19,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:28:19,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:28:19,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:28:19,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:28:19,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:28:19,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:28:19,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:28:19,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:28:19,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:28:19,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:28:19,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:28:20,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:28:20,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:28:20,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:28:20,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:28:20,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:28:20,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:28:20,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:28:20,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:28:20,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:28:20,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:28:20,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:28:20,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:28:20,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:28:20,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:28:20,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:28:20,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:28:20,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:28:20,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:28:20,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:28:20,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:28:20,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:28:20,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:28:20,029 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-01 22:28:20,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:28:20,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:28:20,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:28:20,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:28:20,058 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:28:20,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:28:20,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:28:20,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:28:20,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:28:20,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:28:20,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:28:20,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:28:20,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:28:20,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:28:20,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:28:20,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:28:20,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:28:20,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:28:20,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:28:20,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:28:20,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:28:20,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:28:20,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:28:20,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:28:20,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:28:20,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:28:20,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:28:20,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:28:20,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:28:20,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:28:20,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:28:20,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:28:20,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:28:20,142 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:28:20,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-01 22:28:20,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e3a5ac1/14b994ec71de41478af6f0b3e0021b16/FLAG30aafff82 [2019-10-01 22:28:20,698 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:28:20,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-01 22:28:20,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e3a5ac1/14b994ec71de41478af6f0b3e0021b16/FLAG30aafff82 [2019-10-01 22:28:21,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79e3a5ac1/14b994ec71de41478af6f0b3e0021b16 [2019-10-01 22:28:21,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:28:21,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:28:21,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:21,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:28:21,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:28:21,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5127fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21, skipping insertion in model container [2019-10-01 22:28:21,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,054 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:28:21,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:28:21,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:21,285 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:28:21,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:28:21,325 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:28:21,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21 WrapperNode [2019-10-01 22:28:21,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:28:21,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:28:21,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:28:21,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:28:21,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (1/1) ... [2019-10-01 22:28:21,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:28:21,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:28:21,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:28:21,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:28:21,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (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-01 22:28:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:28:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:28:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:28:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:28:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:28:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:28:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:28:21,806 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:28:21,807 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 22:28:21,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:21 BoogieIcfgContainer [2019-10-01 22:28:21,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:28:21,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:28:21,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:28:21,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:28:21,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:28:21" (1/3) ... [2019-10-01 22:28:21,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d77fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:21, skipping insertion in model container [2019-10-01 22:28:21,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:28:21" (2/3) ... [2019-10-01 22:28:21,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d77fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:28:21, skipping insertion in model container [2019-10-01 22:28:21,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:28:21" (3/3) ... [2019-10-01 22:28:21,832 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.c [2019-10-01 22:28:21,843 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:28:21,865 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:28:21,881 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:28:21,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:28:21,907 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:28:21,907 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:28:21,907 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:28:21,907 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:28:21,907 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:28:21,908 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:28:21,908 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:28:21,908 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:28:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:28:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:21,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:21,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:21,936 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1746448729, now seen corresponding path program 1 times [2019-10-01 22:28:21,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:21,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:21,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,076 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-01 22:28:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:28:22,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:28:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:28:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:28:22,094 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:28:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:22,116 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2019-10-01 22:28:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:28:22,117 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 22:28:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:22,126 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:28:22,126 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:28:22,129 INFO L640 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-10-01 22:28:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:28:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:28:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:28:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 22:28:22,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-10-01 22:28:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:22,170 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 22:28:22,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:28:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 22:28:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 22:28:22,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:22,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:22,172 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash 934485258, now seen corresponding path program 1 times [2019-10-01 22:28:22,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,235 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-01 22:28:22,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:22,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:22,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:22,238 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 22:28:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:22,277 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 22:28:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:22,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 22:28:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:22,279 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:28:22,280 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:28:22,281 INFO L640 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-10-01 22:28:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:28:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 22:28:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:28:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:28:22,288 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2019-10-01 22:28:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:22,288 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:28:22,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:28:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 22:28:22,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:22,290 INFO L411 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-01 22:28:22,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1806235348, now seen corresponding path program 1 times [2019-10-01 22:28:22,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:22,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:28:22,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:22,428 INFO L224 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-10-01 22:28:22,457 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-10-01 22:28:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:28:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:22,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:28:22,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-01 22:28:22,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:28:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:28:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:28:22,543 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-10-01 22:28:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:22,715 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-10-01 22:28:22,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:28:22,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-01 22:28:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:22,719 INFO L225 Difference]: With dead ends: 68 [2019-10-01 22:28:22,719 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 22:28:22,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:28:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 22:28:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2019-10-01 22:28:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 22:28:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-10-01 22:28:22,737 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2019-10-01 22:28:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:22,739 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-10-01 22:28:22,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:28:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-10-01 22:28:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 22:28:22,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:22,740 INFO L411 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] [2019-10-01 22:28:22,741 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:22,741 INFO L82 PathProgramCache]: Analyzing trace with hash -467431540, now seen corresponding path program 1 times [2019-10-01 22:28:22,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:28:22,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:22,908 INFO L224 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-10-01 22:28:22,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:22,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:28:22,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:28:23,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:23,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:28:23,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:23,006 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 8 states. [2019-10-01 22:28:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:23,210 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2019-10-01 22:28:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:28:23,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-10-01 22:28:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:23,213 INFO L225 Difference]: With dead ends: 84 [2019-10-01 22:28:23,213 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 22:28:23,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:28:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 22:28:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-10-01 22:28:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:28:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-01 22:28:23,230 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2019-10-01 22:28:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:23,232 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-01 22:28:23,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-01 22:28:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:28:23,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:23,234 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:23,234 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 317446851, now seen corresponding path program 1 times [2019-10-01 22:28:23,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:23,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:23,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:23,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:23,333 INFO L224 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-10-01 22:28:23,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:23,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:28:23,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:23,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:23,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-01 22:28:23,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:28:23,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:28:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:23,439 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2019-10-01 22:28:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:23,493 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-10-01 22:28:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:28:23,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 22:28:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:23,495 INFO L225 Difference]: With dead ends: 70 [2019-10-01 22:28:23,495 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 22:28:23,496 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:28:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 22:28:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-01 22:28:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 22:28:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-01 22:28:23,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2019-10-01 22:28:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:23,504 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-01 22:28:23,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:28:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-01 22:28:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:28:23,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:23,505 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:23,505 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:23,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1146435745, now seen corresponding path program 2 times [2019-10-01 22:28:23,506 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:23,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:23,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:23,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:23,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 22:28:23,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:23,605 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:23,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:23,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:23,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:28:23,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 22:28:23,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:23,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-01 22:28:23,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:28:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:28:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:28:23,737 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2019-10-01 22:28:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:23,965 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2019-10-01 22:28:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:28:23,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-10-01 22:28:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:23,967 INFO L225 Difference]: With dead ends: 113 [2019-10-01 22:28:23,967 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 22:28:23,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 22:28:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-10-01 22:28:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:28:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-10-01 22:28:23,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 29 [2019-10-01 22:28:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:23,977 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-10-01 22:28:23,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:28:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-10-01 22:28:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:28:23,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:23,979 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:23,979 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash 321576404, now seen corresponding path program 3 times [2019-10-01 22:28:23,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:23,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:23,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:28:24,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:24,061 INFO L224 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-10-01 22:28:24,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:24,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:24,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:24,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:28:24,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:24,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-01 22:28:24,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:24,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:24,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:24,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-01 22:28:24,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-01 22:28:24,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:24,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2019-10-01 22:28:24,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:28:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:28:24,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:24,358 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 16 states. [2019-10-01 22:28:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:24,800 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2019-10-01 22:28:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:28:24,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-10-01 22:28:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:24,802 INFO L225 Difference]: With dead ends: 113 [2019-10-01 22:28:24,802 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:28:24,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:28:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:28:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-10-01 22:28:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:28:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2019-10-01 22:28:24,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 34 [2019-10-01 22:28:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:24,815 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2019-10-01 22:28:24,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:28:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2019-10-01 22:28:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 22:28:24,816 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:24,816 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:24,817 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1613423984, now seen corresponding path program 2 times [2019-10-01 22:28:24,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:24,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:24,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:24,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 22:28:24,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:24,934 INFO L224 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) [2019-10-01 22:28:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:24,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:24,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:24,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:28:24,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 22:28:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-01 22:28:25,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:28:25,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:28:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:28:25,100 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 14 states. [2019-10-01 22:28:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:25,398 INFO L93 Difference]: Finished difference Result 204 states and 247 transitions. [2019-10-01 22:28:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:28:25,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-10-01 22:28:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:25,403 INFO L225 Difference]: With dead ends: 204 [2019-10-01 22:28:25,403 INFO L226 Difference]: Without dead ends: 152 [2019-10-01 22:28:25,404 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:28:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-01 22:28:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 78. [2019-10-01 22:28:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 22:28:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-10-01 22:28:25,419 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 36 [2019-10-01 22:28:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:25,420 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-10-01 22:28:25,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:28:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-10-01 22:28:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 22:28:25,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:25,423 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:25,423 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1163880982, now seen corresponding path program 4 times [2019-10-01 22:28:25,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:25,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 22:28:25,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:28:25,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:28:25,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:28:25,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:28:25,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:28:25,506 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2019-10-01 22:28:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:25,521 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-10-01 22:28:25,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:28:25,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-01 22:28:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:25,522 INFO L225 Difference]: With dead ends: 97 [2019-10-01 22:28:25,523 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:28:25,523 INFO L640 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-10-01 22:28:25,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:28:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-01 22:28:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:28:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-10-01 22:28:25,533 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 38 [2019-10-01 22:28:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:25,533 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-10-01 22:28:25,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:28:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-10-01 22:28:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:28:25,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:25,535 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:25,535 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash -216190442, now seen corresponding path program 1 times [2019-10-01 22:28:25,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:25,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:25,648 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:28:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:25,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:28:25,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:25,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-01 22:28:25,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:28:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:28:25,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:25,810 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 16 states. [2019-10-01 22:28:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:25,915 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2019-10-01 22:28:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:28:25,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-10-01 22:28:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:25,917 INFO L225 Difference]: With dead ends: 122 [2019-10-01 22:28:25,917 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:28:25,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=135, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:28:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:28:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:28:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:28:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-10-01 22:28:25,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 40 [2019-10-01 22:28:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:25,948 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-10-01 22:28:25,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:28:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-10-01 22:28:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:28:25,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:25,950 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:25,951 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:25,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:25,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2065183496, now seen corresponding path program 2 times [2019-10-01 22:28:25,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:25,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:28:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:26,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:26,107 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:26,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:28:26,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:28:26,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:28:26,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:26,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-01 22:28:26,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:28:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:28:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:26,296 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 18 states. [2019-10-01 22:28:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:28:26,407 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-10-01 22:28:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:28:26,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-10-01 22:28:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:28:26,409 INFO L225 Difference]: With dead ends: 124 [2019-10-01 22:28:26,409 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 22:28:26,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:28:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 22:28:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-01 22:28:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-01 22:28:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-10-01 22:28:26,427 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 42 [2019-10-01 22:28:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:28:26,427 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-10-01 22:28:26,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:28:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-10-01 22:28:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:28:26,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:28:26,431 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:28:26,431 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:28:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:28:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -831047846, now seen corresponding path program 3 times [2019-10-01 22:28:26,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:28:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:28:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:26,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:28:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:28:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:28:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 22:28:26,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:28:26,588 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:28:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:28:26,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:28:26,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:28:26,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:28:26,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:28:26,808 INFO L341 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-10-01 22:28:26,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 59 [2019-10-01 22:28:26,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:26,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:26,833 INFO L567 ElimStorePlain]: treesize reduction 25, result has 63.2 percent of original size [2019-10-01 22:28:26,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:26,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2019-10-01 22:28:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:32,970 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-01 22:28:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:39,018 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-01 22:28:41,070 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-01 22:28:41,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:28:41,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:28:41,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:28:41,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:41,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 11 [2019-10-01 22:28:41,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:28:41,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:28:41,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:28:41,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:4 [2019-10-01 22:28:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:28:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-01 22:28:41,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:28:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2019-10-01 22:28:41,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:28:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:28:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=405, Unknown=4, NotChecked=0, Total=506 [2019-10-01 22:28:41,179 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 23 states. [2019-10-01 22:31:09,111 WARN L191 SmtUtils]: Spent 14.08 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-10-01 22:31:39,356 WARN L191 SmtUtils]: Spent 14.09 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-10-01 22:31:53,511 WARN L191 SmtUtils]: Spent 14.09 s on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-10-01 22:33:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:33:10,065 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2019-10-01 22:33:10,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 22:33:10,065 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-10-01 22:33:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:33:10,067 INFO L225 Difference]: With dead ends: 189 [2019-10-01 22:33:10,068 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 22:33:10,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 159.6s TimeCoverageRelationStatistics Valid=581, Invalid=2120, Unknown=55, NotChecked=0, Total=2756 [2019-10-01 22:33:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 22:33:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-01 22:33:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:33:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-10-01 22:33:10,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 44 [2019-10-01 22:33:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:33:10,082 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-10-01 22:33:10,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:33:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-10-01 22:33:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:33:10,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:33:10,084 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:33:10,084 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:33:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:33:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -640146929, now seen corresponding path program 4 times [2019-10-01 22:33:10,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:33:10,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:33:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:10,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:33:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:33:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:33:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-01 22:33:10,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:33:10,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:33:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:33:10,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:33:10,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:33:10,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:33:10,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:33:10,478 INFO L341 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-10-01 22:33:10,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 59 [2019-10-01 22:33:10,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:10,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:33:10,507 INFO L567 ElimStorePlain]: treesize reduction 32, result has 50.0 percent of original size [2019-10-01 22:33:10,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:33:10,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-01 22:33:11,110 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-10-01 22:33:11,110 INFO L341 Elim1Store]: treesize reduction 104, result has 61.6 percent of original size [2019-10-01 22:33:11,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 185 [2019-10-01 22:33:11,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:33:11,259 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2019-10-01 22:33:11,260 INFO L567 ElimStorePlain]: treesize reduction 375, result has 15.9 percent of original size [2019-10-01 22:33:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-01 22:33:11,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:70 [2019-10-01 22:33:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:11,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:17,786 WARN L191 SmtUtils]: Spent 5.52 s on a formula simplification that was a NOOP. DAG size: 44 [2019-10-01 22:33:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:17,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:33:17,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 156 [2019-10-01 22:33:17,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:33:17,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:33:17,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:33:17,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 109 [2019-10-01 22:33:17,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:33:18,087 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-01 22:33:18,088 INFO L567 ElimStorePlain]: treesize reduction 102, result has 62.1 percent of original size [2019-10-01 22:33:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:18,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-01 22:33:18,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:149, output treesize:167 [2019-10-01 22:33:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:48,224 WARN L191 SmtUtils]: Spent 16.05 s on a formula simplification that was a NOOP. DAG size: 68 [2019-10-01 22:33:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:33:48,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:34:36,737 WARN L191 SmtUtils]: Spent 32.10 s on a formula simplification that was a NOOP. DAG size: 75 [2019-10-01 22:35:35,147 WARN L191 SmtUtils]: Spent 40.15 s on a formula simplification that was a NOOP. DAG size: 97 [2019-10-01 22:35:35,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-01 22:35:35,169 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_11], 20=[v_prenex_14, |#memory_int|], 42=[v_prenex_17]} [2019-10-01 22:35:35,204 INFO L341 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2019-10-01 22:35:35,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 40 [2019-10-01 22:35:35,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:35,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:35,389 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-01 22:35:35,390 INFO L341 Elim1Store]: treesize reduction 35, result has 77.7 percent of original size [2019-10-01 22:35:35,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 143 [2019-10-01 22:35:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:35,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:35,573 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-01 22:35:35,574 INFO L341 Elim1Store]: treesize reduction 35, result has 77.7 percent of original size [2019-10-01 22:35:35,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 143 [2019-10-01 22:35:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,589 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:35,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:35,902 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-10-01 22:35:35,902 INFO L341 Elim1Store]: treesize reduction 51, result has 84.6 percent of original size [2019-10-01 22:35:35,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 309 [2019-10-01 22:35:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,266 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-01 22:35:36,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:35:36,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:35:36,314 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:260, output treesize:4 [2019-10-01 22:35:36,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:35:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 10 refuted. 1 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 22:35:36,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:35:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2019-10-01 22:35:36,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:35:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:35:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=579, Unknown=17, NotChecked=0, Total=702 [2019-10-01 22:35:36,454 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 27 states. [2019-10-01 22:36:45,536 WARN L191 SmtUtils]: Spent 19.57 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-01 22:37:23,764 WARN L191 SmtUtils]: Spent 32.14 s on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-10-01 22:38:50,349 WARN L191 SmtUtils]: Spent 1.31 m on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-10-01 22:40:30,310 WARN L191 SmtUtils]: Spent 1.57 m on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2019-10-01 22:40:48,609 WARN L191 SmtUtils]: Spent 12.20 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-01 22:41:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:10,952 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2019-10-01 22:41:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:41:10,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-10-01 22:41:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:10,955 INFO L225 Difference]: With dead ends: 163 [2019-10-01 22:41:10,955 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 22:41:10,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 419.7s TimeCoverageRelationStatistics Valid=194, Invalid=1176, Unknown=36, NotChecked=0, Total=1406 [2019-10-01 22:41:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 22:41:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2019-10-01 22:41:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 22:41:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-01 22:41:10,968 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 47 [2019-10-01 22:41:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:10,969 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-01 22:41:10,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:41:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-01 22:41:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-01 22:41:10,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:10,970 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:10,970 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -162792164, now seen corresponding path program 5 times [2019-10-01 22:41:10,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:10,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:41:11,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:11,113 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:11,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:41:11,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:41:11,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:11,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:41:11,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:41:11,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:11,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-10-01 22:41:11,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:41:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:41:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:41:11,337 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 20 states. [2019-10-01 22:41:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:41:11,901 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2019-10-01 22:41:11,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:41:11,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-10-01 22:41:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:41:11,903 INFO L225 Difference]: With dead ends: 240 [2019-10-01 22:41:11,903 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 22:41:11,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:41:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 22:41:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 111. [2019-10-01 22:41:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:41:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-10-01 22:41:11,921 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2019-10-01 22:41:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:41:11,921 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-10-01 22:41:11,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:41:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-10-01 22:41:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:41:11,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:41:11,936 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:41:11,937 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:41:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:41:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -782265363, now seen corresponding path program 6 times [2019-10-01 22:41:11,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:41:11,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:41:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:11,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:41:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:41:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:41:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:41:12,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:41:12,124 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:41:12,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:41:12,193 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:41:12,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:41:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:41:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:41:12,348 INFO L341 Elim1Store]: treesize reduction 52, result has 45.8 percent of original size [2019-10-01 22:41:12,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 59 [2019-10-01 22:41:12,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:12,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:41:12,374 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.2 percent of original size [2019-10-01 22:41:12,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:41:12,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:43 [2019-10-01 22:41:12,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,466 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-01 22:41:18,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:18,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:18,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:41:18,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 134 [2019-10-01 22:41:18,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:41:18,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:18,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:18,669 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:41:18,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 64 treesize of output 244 [2019-10-01 22:41:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:18,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 22:41:19,218 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 43 [2019-10-01 22:41:19,218 INFO L567 ElimStorePlain]: treesize reduction 1363, result has 8.6 percent of original size [2019-10-01 22:41:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:19,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-01 22:41:19,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:89 [2019-10-01 22:41:19,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:19,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:25,423 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-01 22:41:25,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 22:41:33,488 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-10-01 22:41:35,530 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-01 22:41:35,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:35,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:35,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 22:41:35,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:41:35,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 11 [2019-10-01 22:41:35,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 22:41:35,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 22:41:35,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 22:41:35,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:4 [2019-10-01 22:41:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 22:41:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-01 22:41:35,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:41:35,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-10-01 22:41:35,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 22:41:35,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 22:41:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=604, Unknown=6, NotChecked=0, Total=756 [2019-10-01 22:41:35,638 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 28 states.