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-tiling/tcpy.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:46:54,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:46:54,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:46:54,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:46:54,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:46:54,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:46:54,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:46:54,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:46:54,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:46:54,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:46:54,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:46:54,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:46:54,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:46:54,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:46:54,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:46:54,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:46:54,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:46:54,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:46:54,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:46:54,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:46:54,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:46:54,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:46:54,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:46:54,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:46:54,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:46:54,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:46:54,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:46:54,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:46:54,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:46:54,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:46:54,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:46:54,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:46:54,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:46:54,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:46:54,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:46:54,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:46:54,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:46:54,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:46:54,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:46:54,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:46:54,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:46:54,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 11:46:54,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:46:54,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:46:54,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:46:54,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:46:54,700 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:46:54,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:46:54,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:46:54,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:46:54,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:46:54,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:46:54,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:46:54,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:46:54,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:46:54,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:46:54,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:46:54,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:46:54,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:46:54,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:46:54,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:46:54,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:46:54,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:46:54,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:46:54,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:46:54,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:46:54,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:46:54,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:46:54,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:46:54,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:46:54,755 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:46:54,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-07 11:46:54,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d630c47f8/8f9d124115b0470c94ebcb29b44fb1e1/FLAGece1f43d1 [2019-09-07 11:46:55,235 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:46:55,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-07 11:46:55,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d630c47f8/8f9d124115b0470c94ebcb29b44fb1e1/FLAGece1f43d1 [2019-09-07 11:46:55,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d630c47f8/8f9d124115b0470c94ebcb29b44fb1e1 [2019-09-07 11:46:55,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:46:55,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:46:55,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:46:55,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:46:55,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:46:55,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:55,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d390af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55, skipping insertion in model container [2019-09-07 11:46:55,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:55,607 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:46:55,625 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:46:55,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:46:55,883 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:46:55,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:46:55,941 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:46:55,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55 WrapperNode [2019-09-07 11:46:55,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:46:55,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:46:55,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:46:55,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:46:56,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... [2019-09-07 11:46:56,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:46:56,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:46:56,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:46:56,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:46:56,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:46:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:46:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:46:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 11:46:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:46:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:46:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 11:46:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:46:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:46:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:46:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:46:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:46:56,419 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:46:56,420 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:46:56,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:46:56 BoogieIcfgContainer [2019-09-07 11:46:56,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:46:56,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:46:56,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:46:56,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:46:56,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:46:55" (1/3) ... [2019-09-07 11:46:56,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e654de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:46:56, skipping insertion in model container [2019-09-07 11:46:56,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:46:55" (2/3) ... [2019-09-07 11:46:56,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e654de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:46:56, skipping insertion in model container [2019-09-07 11:46:56,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:46:56" (3/3) ... [2019-09-07 11:46:56,429 INFO L109 eAbstractionObserver]: Analyzing ICFG tcpy.c [2019-09-07 11:46:56,439 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:46:56,448 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:46:56,482 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:46:56,527 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:46:56,530 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:46:56,530 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:46:56,530 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:46:56,530 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:46:56,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:46:56,531 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:46:56,531 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:46:56,531 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:46:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-07 11:46:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:46:56,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:56,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:56,563 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 941892528, now seen corresponding path program 1 times [2019-09-07 11:46:56,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:46:56,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:46:56,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:46:56,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:46:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:46:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:46:56,759 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-07 11:46:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:56,780 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-09-07 11:46:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:46:56,781 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-07 11:46:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:56,790 INFO L225 Difference]: With dead ends: 47 [2019-09-07 11:46:56,790 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 11:46:56,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:46:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 11:46:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 11:46:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 11:46:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-07 11:46:56,833 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-09-07 11:46:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:56,835 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-07 11:46:56,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:46:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-07 11:46:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 11:46:56,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:56,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:56,838 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2128337372, now seen corresponding path program 1 times [2019-09-07 11:46:56,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:56,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:56,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:46:56,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:46:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:46:56,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:46:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:46:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:46:56,958 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-07 11:46:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:57,015 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-07 11:46:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:46:57,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 11:46:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:57,016 INFO L225 Difference]: With dead ends: 39 [2019-09-07 11:46:57,017 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 11:46:57,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:46:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 11:46:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 11:46:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 11:46:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 11:46:57,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-07 11:46:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:57,026 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 11:46:57,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:46:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 11:46:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 11:46:57,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:57,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:57,028 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 823833890, now seen corresponding path program 1 times [2019-09-07 11:46:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:57,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:57,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:46:57,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:46:57,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 11:46:57,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:46:57,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:46:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:46:57,142 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-09-07 11:46:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:57,217 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-07 11:46:57,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:46:57,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-07 11:46:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:57,221 INFO L225 Difference]: With dead ends: 42 [2019-09-07 11:46:57,221 INFO L226 Difference]: Without dead ends: 31 [2019-09-07 11:46:57,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:46:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-07 11:46:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-07 11:46:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 11:46:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-07 11:46:57,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-09-07 11:46:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:57,235 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-07 11:46:57,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:46:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-07 11:46:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 11:46:57,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:57,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:57,237 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1371679936, now seen corresponding path program 1 times [2019-09-07 11:46:57,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:57,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:46:57,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:57,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:57,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:57,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:46:57,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 11:46:57,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:57,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 11:46:57,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:46:57,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:46:57,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:46:57,464 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-09-07 11:46:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:57,552 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-07 11:46:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:46:57,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-07 11:46:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:57,553 INFO L225 Difference]: With dead ends: 43 [2019-09-07 11:46:57,553 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 11:46:57,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:46:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 11:46:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 11:46:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 11:46:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-07 11:46:57,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-09-07 11:46:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:57,562 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-07 11:46:57,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:46:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-07 11:46:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 11:46:57,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:57,563 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:57,563 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:57,564 INFO L82 PathProgramCache]: Analyzing trace with hash -172159810, now seen corresponding path program 2 times [2019-09-07 11:46:57,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:57,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:57,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:46:57,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:46:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:57,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:57,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:46:58,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:46:58,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:46:58,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 11:46:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:58,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:46:58,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:58,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:58,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:58,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 11:46:58,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:58,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:58,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:58,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2019-09-07 11:46:58,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:58,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:58,215 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-09-07 11:46:58,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-09-07 11:46:58,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:46:58,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-07 11:46:58,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:58,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:58,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:58,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-07 11:46:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:46:58,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:46:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-07 11:46:58,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 11:46:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 11:46:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-07 11:46:58,374 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 14 states. [2019-09-07 11:46:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:46:58,609 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-07 11:46:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:46:58,611 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-09-07 11:46:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:46:58,612 INFO L225 Difference]: With dead ends: 38 [2019-09-07 11:46:58,612 INFO L226 Difference]: Without dead ends: 36 [2019-09-07 11:46:58,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-07 11:46:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-07 11:46:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-09-07 11:46:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:46:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-07 11:46:58,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-09-07 11:46:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:46:58,621 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-07 11:46:58,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 11:46:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-07 11:46:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 11:46:58,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:46:58,622 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:46:58,623 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:46:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:46:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 606859858, now seen corresponding path program 1 times [2019-09-07 11:46:58,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:46:58,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:46:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:58,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:46:58,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:46:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:46:59,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:46:59,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:46:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:46:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:46:59,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 11:46:59,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:46:59,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:46:59,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:59,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:59,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:59,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 11:46:59,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:46:59,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:46:59,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:46:59,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:46:59,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-07 11:47:00,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:00,081 INFO L341 Elim1Store]: treesize reduction 31, result has 45.6 percent of original size [2019-09-07 11:47:00,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 52 [2019-09-07 11:47:00,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:00,108 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-09-07 11:47:00,109 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-09-07 11:47:00,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2019-09-07 11:47:02,239 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~acopy~0.offset_BEFORE_CALL_1 Int) (v_main_~acopy~0.base_BEFORE_CALL_1 Int) (~SIZE~0 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_1))) (and (= (select .cse0 v_main_~acopy~0.offset_BEFORE_CALL_1) (select .cse1 v_main_~a~0.offset_BEFORE_CALL_1)) (not (= v_main_~a~0.base_BEFORE_CALL_1 v_main_~acopy~0.base_BEFORE_CALL_1)) (< 1 ~SIZE~0) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ .cse2 v_main_~a~0.offset_BEFORE_CALL_1 (- 4))) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_1 .cse2 (- 4))))) (<= ~SIZE~0 2)))) is different from true [2019-09-07 11:47:02,444 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-09-07 11:47:02,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 69 [2019-09-07 11:47:02,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:02,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:02,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:02,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:02,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:02,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-07 11:47:02,483 INFO L567 ElimStorePlain]: treesize reduction 23, result has 37.8 percent of original size [2019-09-07 11:47:02,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:02,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:3 [2019-09-07 11:47:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:47:02,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:02,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2019-09-07 11:47:02,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 11:47:02,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 11:47:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=575, Unknown=1, NotChecked=48, Total=702 [2019-09-07 11:47:02,542 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 27 states. [2019-09-07 11:47:07,296 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-07 11:47:09,349 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 11:47:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:13,817 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-09-07 11:47:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:47:13,818 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-09-07 11:47:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:13,821 INFO L225 Difference]: With dead ends: 81 [2019-09-07 11:47:13,821 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 11:47:13,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=4, NotChecked=76, Total=1640 [2019-09-07 11:47:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 11:47:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-09-07 11:47:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-07 11:47:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-09-07 11:47:13,833 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 30 [2019-09-07 11:47:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:13,833 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-09-07 11:47:13,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 11:47:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-09-07 11:47:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 11:47:13,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:13,835 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:13,835 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1975161648, now seen corresponding path program 2 times [2019-09-07 11:47:13,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:13,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:13,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:47:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 11:47:14,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:14,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:47:14,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:14,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:47:14,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:14,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:47:14,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:47:14,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:14,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-07 11:47:14,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:47:14,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:47:14,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:47:14,271 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 13 states. [2019-09-07 11:47:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:14,591 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-09-07 11:47:14,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:47:14,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-07 11:47:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:14,593 INFO L225 Difference]: With dead ends: 83 [2019-09-07 11:47:14,593 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:47:14,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-09-07 11:47:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:47:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-09-07 11:47:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 11:47:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-07 11:47:14,606 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2019-09-07 11:47:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:14,606 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-07 11:47:14,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:47:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-07 11:47:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 11:47:14,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:14,608 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:14,608 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -42121234, now seen corresponding path program 3 times [2019-09-07 11:47:14,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:14,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:14,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 11:47:14,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:14,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:14,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:47:14,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:47:14,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:14,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 11:47:14,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:14,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:47:14,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:14,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:14,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:14,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 11:47:14,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:14,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:14,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:14,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-09-07 11:47:14,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:15,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:15,001 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-09-07 11:47:15,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-09-07 11:47:17,097 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (~SIZE~0 Int) (v_main_~acopy~0.base_BEFORE_CALL_2 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_2)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_2))) (and (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (mod ~SIZE~0 2) 0) (= (select .cse2 4) (select .cse0 4)) (not (= v_main_~a~0.base_BEFORE_CALL_2 v_main_~acopy~0.base_BEFORE_CALL_2))))) is different from true [2019-09-07 11:47:17,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:17,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-07 11:47:17,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:17,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:17,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:17,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-07 11:47:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:47:17,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:17,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:47:17,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:47:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:47:17,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2019-09-07 11:47:17,285 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 20 states. [2019-09-07 11:47:27,884 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 11:47:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:33,008 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-09-07 11:47:33,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 11:47:33,009 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-09-07 11:47:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:33,011 INFO L225 Difference]: With dead ends: 122 [2019-09-07 11:47:33,011 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 11:47:33,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=365, Invalid=1702, Unknown=7, NotChecked=88, Total=2162 [2019-09-07 11:47:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 11:47:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2019-09-07 11:47:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 11:47:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-09-07 11:47:33,025 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 34 [2019-09-07 11:47:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:33,026 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-09-07 11:47:33,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:47:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-09-07 11:47:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 11:47:33,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:33,027 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:33,027 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:33,028 INFO L82 PathProgramCache]: Analyzing trace with hash -210369562, now seen corresponding path program 4 times [2019-09-07 11:47:33,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:33,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:33,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:33,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:47:33,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:33,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:47:33,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:33,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:47:33,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:33,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:47:33,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 11:47:33,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:33,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-07 11:47:33,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 11:47:33,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 11:47:33,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-07 11:47:33,208 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 13 states. [2019-09-07 11:47:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:33,410 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-09-07 11:47:33,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:47:33,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-07 11:47:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:33,412 INFO L225 Difference]: With dead ends: 89 [2019-09-07 11:47:33,413 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 11:47:33,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-07 11:47:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 11:47:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-09-07 11:47:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:47:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-07 11:47:33,423 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-09-07 11:47:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:33,423 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-07 11:47:33,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 11:47:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-07 11:47:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 11:47:33,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:33,425 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:33,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -595219712, now seen corresponding path program 5 times [2019-09-07 11:47:33,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:33,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:47:34,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:34,572 INFO L223 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-09-07 11:47:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:47:34,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 11:47:34,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:34,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 11:47:34,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:35,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:35,006 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:35,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:35,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:35,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:35,026 INFO L341 Elim1Store]: treesize reduction 39, result has 36.1 percent of original size [2019-09-07 11:47:35,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2019-09-07 11:47:35,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:35,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:35,043 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-09-07 11:47:35,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:49 [2019-09-07 11:47:35,289 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:35,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:35,324 INFO L341 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2019-09-07 11:47:35,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 35 [2019-09-07 11:47:35,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:35,340 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-09-07 11:47:35,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:35,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2019-09-07 11:47:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:47:35,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:35,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2019-09-07 11:47:35,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 11:47:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 11:47:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 11:47:35,435 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 35 states. [2019-09-07 11:47:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:47:37,383 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-09-07 11:47:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 11:47:37,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-09-07 11:47:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:47:37,385 INFO L225 Difference]: With dead ends: 112 [2019-09-07 11:47:37,385 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 11:47:37,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 11:47:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 11:47:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-09-07 11:47:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 11:47:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-07 11:47:37,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2019-09-07 11:47:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:47:37,402 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-07 11:47:37,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 11:47:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-07 11:47:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 11:47:37,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:47:37,404 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:47:37,404 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:47:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:47:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash -310382338, now seen corresponding path program 6 times [2019-09-07 11:47:37,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:47:37,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:47:37,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:37,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:47:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:47:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:47:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:47:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:47:37,768 INFO L223 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-09-07 11:47:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:47:37,831 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 11:47:37,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:47:37,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 11:47:37,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:47:37,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:47:37,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:37,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-07 11:47:37,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:47:37,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:37,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-09-07 11:47:37,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:47:37,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,991 INFO L567 ElimStorePlain]: treesize reduction 3, result has 89.3 percent of original size [2019-09-07 11:47:37,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:37,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2019-09-07 11:47:38,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:47:38,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:38,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:38,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:38,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-07 11:47:38,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,096 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:38,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 101 [2019-09-07 11:47:38,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:38,139 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-09-07 11:47:38,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:38,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:65 [2019-09-07 11:47:38,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:38,385 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-07 11:47:38,386 INFO L341 Elim1Store]: treesize reduction 90, result has 74.9 percent of original size [2019-09-07 11:47:38,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 337 [2019-09-07 11:47:38,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:38,503 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-07 11:47:38,504 INFO L567 ElimStorePlain]: treesize reduction 310, result has 27.2 percent of original size [2019-09-07 11:47:38,505 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-09-07 11:47:38,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:116 [2019-09-07 11:47:38,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:38,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:47:40,782 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_5 Int) (v_main_~acopy~0.base_BEFORE_CALL_5 Int) (v_main_~a~0.base_BEFORE_CALL_5 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int)) (let ((.cse2 (* 4 ~SIZE~0)) (.cse3 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_5)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_5))) (and (let ((.cse1 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse1 .cse2 (- 4))) (select .cse3 (+ .cse1 .cse2 (- 4))))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* 4 v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse4)) (select .cse3 .cse4))) (not (= v_main_~a~0.base_BEFORE_CALL_5 v_main_~acopy~0.base_BEFORE_CALL_5)) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse5 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse5 .cse2 (- 4))) (select .cse3 (+ .cse5 .cse2 (- 4))))) (let ((.cse6 (* 4 v_main_~i~0_41))) (= (select .cse3 .cse6) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse6))))))) is different from true [2019-09-07 11:47:42,945 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_6 Int) (v_main_~acopy~0.base_BEFORE_CALL_6 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int) (v_main_~a~0.base_BEFORE_CALL_6 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_6)) (.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_6)) (.cse5 (* 4 ~SIZE~0))) (and (let ((.cse1 (* 4 v_main_~i~0_41))) (= (select .cse0 .cse1) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse1)))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (let ((.cse3 (* 4 v_main_~i~0_42))) (= (select .cse0 .cse3) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse3)))) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ .cse4 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse4 .cse5 (- 4))))) (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_6 v_main_~acopy~0.base_BEFORE_CALL_6)) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse6 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ .cse6 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse6 .cse5 (- 4)))))))) is different from true [2019-09-07 11:47:43,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 11:47:43,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:47:43,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:47:43,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 7 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 203 [2019-09-07 11:47:43,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:47:43,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:47:43,324 INFO L567 ElimStorePlain]: treesize reduction 1172, result has 2.6 percent of original size [2019-09-07 11:47:43,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:47:43,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:3 [2019-09-07 11:47:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2019-09-07 11:47:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:47:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 30 [2019-09-07 11:47:43,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 11:47:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 11:47:43,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=666, Unknown=2, NotChecked=106, Total=870 [2019-09-07 11:47:43,416 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 30 states. [2019-09-07 11:47:46,517 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-07 11:47:50,622 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 11:47:52,710 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 11:48:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:01,773 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-09-07 11:48:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 11:48:01,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2019-09-07 11:48:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:01,775 INFO L225 Difference]: With dead ends: 136 [2019-09-07 11:48:01,776 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 11:48:01,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=403, Invalid=2906, Unknown=5, NotChecked=226, Total=3540 [2019-09-07 11:48:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 11:48:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-09-07 11:48:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 11:48:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-09-07 11:48:01,791 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 46 [2019-09-07 11:48:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:01,792 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-09-07 11:48:01,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 11:48:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-09-07 11:48:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:48:01,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:01,793 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:01,793 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash -50327652, now seen corresponding path program 7 times [2019-09-07 11:48:01,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:01,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:01,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:01,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:01,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 11:48:02,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:02,154 INFO L223 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-09-07 11:48:02,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:48:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:02,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 11:48:02,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 11:48:02,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:02,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 11:48:02,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 11:48:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 11:48:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-09-07 11:48:02,376 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 20 states. [2019-09-07 11:48:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:03,209 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-09-07 11:48:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 11:48:03,209 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2019-09-07 11:48:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:03,210 INFO L225 Difference]: With dead ends: 139 [2019-09-07 11:48:03,211 INFO L226 Difference]: Without dead ends: 106 [2019-09-07 11:48:03,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 11:48:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-07 11:48:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 68. [2019-09-07 11:48:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 11:48:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-07 11:48:03,229 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 48 [2019-09-07 11:48:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:03,230 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-07 11:48:03,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 11:48:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-07 11:48:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 11:48:03,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:03,231 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:03,232 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash -615831910, now seen corresponding path program 8 times [2019-09-07 11:48:03,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:03,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:03,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:48:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 11:48:04,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:04,159 INFO L223 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) [2019-09-07 11:48:04,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:48:04,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:48:04,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:04,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 11:48:04,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:04,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:48:04,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:04,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:04,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:04,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 11:48:04,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:04,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:04,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:04,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-09-07 11:48:04,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:04,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:04,415 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-09-07 11:48:04,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-09-07 11:48:06,533 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_7 Int) (v_main_~a~0.base_BEFORE_CALL_7 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_7)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_7))) (and (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_7 v_main_~acopy~0.base_BEFORE_CALL_7)) (let ((.cse1 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (select .cse2 8) (select .cse0 8))))) is different from true [2019-09-07 11:48:08,689 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_8 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int) (~SIZE~0 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_8)) (.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_8))) (and (not (= v_main_~a~0.base_BEFORE_CALL_8 v_main_~acopy~0.base_BEFORE_CALL_8)) (= (mod ~SIZE~0 2) 0) (= (select .cse0 8) (select .cse1 8)) (let ((.cse2 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse2) (select .cse1 .cse2)))))) is different from true [2019-09-07 11:48:08,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:08,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-07 11:48:08,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:08,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:08,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:08,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-07 11:48:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 8 not checked. [2019-09-07 11:48:08,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:08,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 34 [2019-09-07 11:48:08,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 11:48:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 11:48:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=879, Unknown=2, NotChecked=122, Total=1122 [2019-09-07 11:48:08,890 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 34 states. [2019-09-07 11:48:11,784 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-07 11:48:13,036 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-07 11:48:17,467 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 11:48:19,884 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 11:48:26,210 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 11:48:30,641 WARN L188 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 11:48:37,928 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-07 11:48:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:48:39,644 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2019-09-07 11:48:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 11:48:39,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 50 [2019-09-07 11:48:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:48:39,648 INFO L225 Difference]: With dead ends: 212 [2019-09-07 11:48:39,648 INFO L226 Difference]: Without dead ends: 210 [2019-09-07 11:48:39,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1783 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=1029, Invalid=5780, Unknown=5, NotChecked=326, Total=7140 [2019-09-07 11:48:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-07 11:48:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 67. [2019-09-07 11:48:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 11:48:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-09-07 11:48:39,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 50 [2019-09-07 11:48:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:48:39,682 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-09-07 11:48:39,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 11:48:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-09-07 11:48:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 11:48:39,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:48:39,683 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:48:39,683 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:48:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:48:39,683 INFO L82 PathProgramCache]: Analyzing trace with hash 958082708, now seen corresponding path program 9 times [2019-09-07 11:48:39,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:48:39,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:48:39,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:39,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:48:39,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:48:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:48:40,262 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 48 [2019-09-07 11:48:40,430 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2019-09-07 11:48:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 11:48:41,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:48:41,080 INFO L223 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-09-07 11:48:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:48:41,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 11:48:41,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:48:41,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 11:48:41,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:48:41,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:48:41,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:41,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 11:48:41,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-07 11:48:41,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:48:41,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-07 11:48:41,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,356 INFO L341 Elim1Store]: treesize reduction 36, result has 57.1 percent of original size [2019-09-07 11:48:41,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2019-09-07 11:48:41,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,389 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.8 percent of original size [2019-09-07 11:48:41,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:62 [2019-09-07 11:48:41,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 121 [2019-09-07 11:48:41,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:48:41,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 117 [2019-09-07 11:48:41,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,663 INFO L567 ElimStorePlain]: treesize reduction 107, result has 47.3 percent of original size [2019-09-07 11:48:41,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:41,664 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:259, output treesize:96 [2019-09-07 11:48:41,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:41,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:48:41,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:48:44,160 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 11:48:45,152 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-09-07 11:48:45,153 INFO L341 Elim1Store]: treesize reduction 56, result has 80.6 percent of original size [2019-09-07 11:48:45,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 91 treesize of output 251 [2019-09-07 11:48:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:48:45,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 11:48:46,259 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 518 DAG size of output: 19 [2019-09-07 11:48:46,259 INFO L567 ElimStorePlain]: treesize reduction 12149, result has 0.2 percent of original size [2019-09-07 11:48:46,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:48:46,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:116, output treesize:3 [2019-09-07 11:48:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 11:48:46,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:48:46,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 40 [2019-09-07 11:48:46,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 11:48:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 11:48:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 11:48:46,399 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 40 states. [2019-09-07 11:48:49,256 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-07 11:48:51,580 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-09-07 11:48:58,876 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 41 [2019-09-07 11:48:59,056 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 44 [2019-09-07 11:49:01,242 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 11:49:05,621 WARN L188 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 11:49:06,204 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2019-09-07 11:49:06,562 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 46 [2019-09-07 11:49:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:49:06,785 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-09-07 11:49:06,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 11:49:06,786 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2019-09-07 11:49:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:49:06,787 INFO L225 Difference]: With dead ends: 106 [2019-09-07 11:49:06,787 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 11:49:06,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=465, Invalid=3073, Unknown=2, NotChecked=0, Total=3540 [2019-09-07 11:49:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 11:49:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-09-07 11:49:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 11:49:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 11:49:06,802 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 52 [2019-09-07 11:49:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:49:06,802 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 11:49:06,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 11:49:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 11:49:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 11:49:06,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:49:06,804 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:49:06,804 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:49:06,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:49:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1251971026, now seen corresponding path program 10 times [2019-09-07 11:49:06,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:49:06,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:49:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:06,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:49:06,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:49:08,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:49:08,303 INFO L223 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-09-07 11:49:08,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:49:08,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:49:08,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:49:08,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 11:49:08,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:49:08,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 11:49:08,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:49:08,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 11:49:08,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:49:08,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 11:49:08,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:08,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:08,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 67 [2019-09-07 11:49:08,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 11:49:08,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 11:49:08,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-09-07 11:49:08,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-07 11:49:08,918 INFO L567 ElimStorePlain]: treesize reduction 70, result has 41.2 percent of original size [2019-09-07 11:49:08,918 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-09-07 11:49:08,919 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:49 [2019-09-07 11:49:11,065 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_12 Int) (v_main_~acopy~0.offset_BEFORE_CALL_12 Int) (v_main_~a~0.base_BEFORE_CALL_12 Int) (v_main_~a~0.offset_BEFORE_CALL_12 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_12)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_12))) (and (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 .cse1 (- 12))) (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 .cse1 (- 12))))) (< 2 (div ~SIZE~0 2)) (not (= v_main_~acopy~0.base_BEFORE_CALL_12 v_main_~a~0.base_BEFORE_CALL_12)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 8)) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 8)))))) is different from true [2019-09-07 11:49:13,232 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_13 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_main_~acopy~0.offset_BEFORE_CALL_13 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_13)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_13))) (and (< 2 (div ~SIZE~0 2)) (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 .cse1 (- 12))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 .cse1 (- 12))))) (not (= v_main_~acopy~0.base_BEFORE_CALL_13 v_main_~a~0.base_BEFORE_CALL_13)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 8)) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 8)))))) is different from true [2019-09-07 11:49:15,430 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_14 Int) (v_main_~a~0.offset_BEFORE_CALL_14 Int) (v_main_~a~0.base_BEFORE_CALL_14 Int) (v_main_~acopy~0.offset_BEFORE_CALL_14 Int) (~SIZE~0 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_14)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_14))) (and (< 2 (div ~SIZE~0 2)) (<= ~SIZE~0 6) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 8)) (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 8))) (not (= v_main_~acopy~0.base_BEFORE_CALL_14 v_main_~a~0.base_BEFORE_CALL_14)) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 .cse2 (- 12))) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 .cse2 (- 12)))))))) is different from true [2019-09-07 11:49:15,648 INFO L341 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2019-09-07 11:49:15,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 73 [2019-09-07 11:49:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:15,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-07 11:49:15,685 INFO L567 ElimStorePlain]: treesize reduction 61, result has 20.8 percent of original size [2019-09-07 11:49:15,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 11:49:15,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:3 [2019-09-07 11:49:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2019-09-07 11:49:15,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:49:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2019-09-07 11:49:15,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 11:49:15,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 11:49:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1546, Unknown=3, NotChecked=246, Total=1980 [2019-09-07 11:49:15,777 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 45 states. [2019-09-07 11:49:23,881 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 11:49:28,164 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 11:49:30,279 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 11:49:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:49:37,493 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-09-07 11:49:37,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 11:49:37,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 58 [2019-09-07 11:49:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:49:37,496 INFO L225 Difference]: With dead ends: 156 [2019-09-07 11:49:37,496 INFO L226 Difference]: Without dead ends: 121 [2019-09-07 11:49:37,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=787, Invalid=4766, Unknown=9, NotChecked=444, Total=6006 [2019-09-07 11:49:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-07 11:49:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2019-09-07 11:49:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 11:49:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-07 11:49:37,516 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 58 [2019-09-07 11:49:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:49:37,517 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-07 11:49:37,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 11:49:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-07 11:49:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 11:49:37,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:49:37,518 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:49:37,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:49:37,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:49:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -734961236, now seen corresponding path program 11 times [2019-09-07 11:49:37,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:49:37,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:49:37,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:37,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:49:37,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:49:38,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:49:38,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:49:38,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:49:38,282 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 11:49:38,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:49:38,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 11:49:38,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:49:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 11:49:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:49:38,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-07 11:49:38,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 11:49:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 11:49:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-09-07 11:49:38,544 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 26 states. [2019-09-07 11:49:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:49:39,758 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2019-09-07 11:49:39,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:49:39,758 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2019-09-07 11:49:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:49:39,760 INFO L225 Difference]: With dead ends: 175 [2019-09-07 11:49:39,760 INFO L226 Difference]: Without dead ends: 142 [2019-09-07 11:49:39,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 11:49:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-07 11:49:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 82. [2019-09-07 11:49:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 11:49:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-09-07 11:49:39,777 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 60 [2019-09-07 11:49:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:49:39,778 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-09-07 11:49:39,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 11:49:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-09-07 11:49:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 11:49:39,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:49:39,779 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:49:39,779 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:49:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:49:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2090228790, now seen corresponding path program 12 times [2019-09-07 11:49:39,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:49:39,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:49:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:39,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:49:39,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-07 11:49:40,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:49:40,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 11:49:40,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:49:40,268 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-07 11:49:40,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:49:40,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 11:49:40,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:49:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 11:49:40,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:49:40,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2019-09-07 11:49:40,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 11:49:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 11:49:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-07 11:49:40,401 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 21 states. [2019-09-07 11:49:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:49:40,904 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2019-09-07 11:49:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 11:49:40,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-07 11:49:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:49:40,908 INFO L225 Difference]: With dead ends: 171 [2019-09-07 11:49:40,908 INFO L226 Difference]: Without dead ends: 128 [2019-09-07 11:49:40,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2019-09-07 11:49:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-07 11:49:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2019-09-07 11:49:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 11:49:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-07 11:49:40,926 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 62 [2019-09-07 11:49:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:49:40,926 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-07 11:49:40,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 11:49:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-07 11:49:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 11:49:40,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:49:40,927 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:49:40,927 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:49:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:49:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 88712776, now seen corresponding path program 13 times [2019-09-07 11:49:40,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:49:40,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:49:40,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:40,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:49:40,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:49:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 92 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 11:49:42,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:49:42,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:49:42,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:49:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:49:42,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 11:49:42,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:49:43,477 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-07 11:49:43,478 INFO L341 Elim1Store]: treesize reduction 357, result has 32.6 percent of original size [2019-09-07 11:49:43,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 229 [2019-09-07 11:49:43,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:43,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 11:49:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 11:49:43,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:49:43,714 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 11:49:43,725 INFO L168 Benchmark]: Toolchain (without parser) took 168131.89 ms. Allocated memory was 141.0 MB in the beginning and 281.0 MB in the end (delta: 140.0 MB). Free memory was 88.6 MB in the beginning and 243.1 MB in the end (delta: -154.5 MB). Peak memory consumption was 164.7 MB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,725 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.57 ms. Allocated memory is still 141.0 MB. Free memory was 88.2 MB in the beginning and 78.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,726 INFO L168 Benchmark]: Boogie Preprocessor took 165.01 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 78.2 MB in the beginning and 178.3 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,727 INFO L168 Benchmark]: RCFGBuilder took 313.57 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 162.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,734 INFO L168 Benchmark]: TraceAbstraction took 167296.93 ms. Allocated memory was 201.3 MB in the beginning and 281.0 MB in the end (delta: 79.7 MB). Free memory was 161.9 MB in the beginning and 243.1 MB in the end (delta: -81.2 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. [2019-09-07 11:49:43,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.57 ms. Allocated memory is still 141.0 MB. Free memory was 88.2 MB in the beginning and 78.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.01 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 78.2 MB in the beginning and 178.3 MB in the end (delta: -100.0 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.57 ms. Allocated memory is still 201.3 MB. Free memory was 178.3 MB in the beginning and 162.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167296.93 ms. Allocated memory was 201.3 MB in the beginning and 281.0 MB in the end (delta: 79.7 MB). Free memory was 161.9 MB in the beginning and 243.1 MB in the end (delta: -81.2 MB). Peak memory consumption was 177.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...