java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:24:00,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:24:00,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:24:00,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:24:00,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:24:00,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:24:00,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:24:00,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:24:00,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:24:00,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:24:00,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:24:00,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:24:00,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:24:00,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:24:00,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:24:00,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:24:00,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:24:00,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:24:00,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:24:00,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:24:00,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:24:00,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:24:00,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:24:00,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:24:00,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:24:00,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:24:00,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:24:00,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:24:00,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:24:00,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:24:00,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:24:00,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:24:00,767 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:24:00,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:24:00,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:24:00,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:24:00,769 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:24:00,784 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:24:00,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:24:00,785 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:24:00,785 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:24:00,785 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:24:00,786 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:24:00,786 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:24:00,786 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:24:00,786 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:24:00,786 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:24:00,787 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:24:00,787 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:24:00,787 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:24:00,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:24:00,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:24:00,788 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:24:00,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:24:00,789 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:24:00,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:24:00,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:24:00,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:24:00,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:24:00,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:24:00,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:24:00,790 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:24:00,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:24:00,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:24:00,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:24:00,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:24:00,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:24:00,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:24:00,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:24:00,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:24:00,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:24:00,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:24:00,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:24:00,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:24:00,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:24:00,793 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:24:00,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:24:00,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:24:00,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:24:00,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:24:00,863 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:24:00,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-03-04 16:24:00,864 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-03-04 16:24:00,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:24:00,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:24:00,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:00,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:24:00,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:24:00,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:00,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:24:00,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:24:00,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:24:00,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:00,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:01,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/1) ... [2019-03-04 16:24:01,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:24:01,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:24:01,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:24:01,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:24:01,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (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-03-04 16:24:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:24:01,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:24:01,327 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:24:01,327 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-03-04 16:24:01,329 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:01 BoogieIcfgContainer [2019-03-04 16:24:01,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:24:01,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:24:01,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:24:01,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:24:01,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:00" (1/2) ... [2019-03-04 16:24:01,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a3e4f7 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:24:01, skipping insertion in model container [2019-03-04 16:24:01,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:01" (2/2) ... [2019-03-04 16:24:01,337 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-03-04 16:24:01,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:24:01,355 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-03-04 16:24:01,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-03-04 16:24:01,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:24:01,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:24:01,409 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:24:01,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:24:01,409 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:24:01,409 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:24:01,410 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:24:01,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:24:01,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:24:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-03-04 16:24:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:24:01,443 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:24:01,451 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-03-04 16:24:01,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:01,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:01,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:01,706 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-03-04 16:24:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,905 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-03-04 16:24:01,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:01,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:24:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,921 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:24:01,922 INFO L226 Difference]: Without dead ends: 16 [2019-03-04 16:24:01,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-04 16:24:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-03-04 16:24:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-03-04 16:24:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:24:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-03-04 16:24:01,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-03-04 16:24:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,967 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-03-04 16:24:01,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-03-04 16:24:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:01,968 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:01,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-03-04 16:24:01,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,276 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:24:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,298 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-03-04 16:24:02,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:02,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:02,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:02,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:02,525 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,544 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,583 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,704 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:02,778 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:02,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:02,987 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,024 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:03,025 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:03,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:03,094 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-03-04 16:24:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,516 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-03-04 16:24:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:03,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,519 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:24:03,519 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:24:03,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:24:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-03-04 16:24:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:24:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-03-04 16:24:03,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-03-04 16:24:03,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,526 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-03-04 16:24:03,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-03-04 16:24:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:03,527 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:03,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-03-04 16:24:03,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:03,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:03,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:03,581 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-03-04 16:24:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,630 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-03-04 16:24:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:03,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:24:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,632 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:24:03,632 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:24:03,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-04 16:24:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:24:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-03-04 16:24:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-03-04 16:24:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-03-04 16:24:03,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-03-04 16:24:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,637 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-03-04 16:24:03,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-03-04 16:24:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:03,638 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:03,639 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,639 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-03-04 16:24:03,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:03,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:03,718 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-03-04 16:24:03,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:03,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:03,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:03,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:03,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:03,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:03,831 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,875 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,882 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,005 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,190 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:04,191 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:04,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:04,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:04,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:04,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:04,307 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 6 states. [2019-03-04 16:24:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:04,517 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2019-03-04 16:24:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:04,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:04,521 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:24:04,521 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:24:04,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:24:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2019-03-04 16:24:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:24:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2019-03-04 16:24:04,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 29 transitions. Word has length 3 [2019-03-04 16:24:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:04,528 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 29 transitions. [2019-03-04 16:24:04,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 29 transitions. [2019-03-04 16:24:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:04,529 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:04,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:04,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-03-04 16:24:04,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:04,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:04,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:04,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:04,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:04,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:04,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:04,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:04,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:04,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:04,772 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,790 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,827 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,843 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,862 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:04,862 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:04,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:04,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:04,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:04,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:04,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:04,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:04,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:04,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:04,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:04,992 INFO L87 Difference]: Start difference. First operand 14 states and 29 transitions. Second operand 6 states. [2019-03-04 16:24:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,191 INFO L93 Difference]: Finished difference Result 30 states and 51 transitions. [2019-03-04 16:24:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:05,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,194 INFO L225 Difference]: With dead ends: 30 [2019-03-04 16:24:05,194 INFO L226 Difference]: Without dead ends: 29 [2019-03-04 16:24:05,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-03-04 16:24:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2019-03-04 16:24:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-03-04 16:24:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 34 transitions. [2019-03-04 16:24:05,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 34 transitions. Word has length 3 [2019-03-04 16:24:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,200 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 34 transitions. [2019-03-04 16:24:05,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 34 transitions. [2019-03-04 16:24:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:05,201 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:05,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash 30244, now seen corresponding path program 1 times [2019-03-04 16:24:05,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:05,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,268 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:05,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:05,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:05,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,354 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:05,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:05,388 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,395 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,403 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,412 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,426 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:05,426 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:05,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:05,485 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,537 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:05,538 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:05,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:05,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:05,573 INFO L87 Difference]: Start difference. First operand 15 states and 34 transitions. Second operand 6 states. [2019-03-04 16:24:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,743 INFO L93 Difference]: Finished difference Result 31 states and 56 transitions. [2019-03-04 16:24:05,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:05,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,745 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:24:05,745 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:24:05,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:24:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 14. [2019-03-04 16:24:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:24:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2019-03-04 16:24:05,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 36 transitions. Word has length 3 [2019-03-04 16:24:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,753 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 36 transitions. [2019-03-04 16:24:05,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 36 transitions. [2019-03-04 16:24:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:05,753 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:05,754 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-03-04 16:24:05,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:05,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:05,813 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-03-04 16:24:05,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:05,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:05,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:05,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:05,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:05,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:05,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:05,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:05,919 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,929 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,939 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,966 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:05,977 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:05,978 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:06,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:06,027 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,037 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:06,073 INFO L87 Difference]: Start difference. First operand 14 states and 36 transitions. Second operand 6 states. [2019-03-04 16:24:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:06,221 INFO L93 Difference]: Finished difference Result 26 states and 51 transitions. [2019-03-04 16:24:06,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:06,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:06,222 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:24:06,222 INFO L226 Difference]: Without dead ends: 25 [2019-03-04 16:24:06,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-03-04 16:24:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2019-03-04 16:24:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-03-04 16:24:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2019-03-04 16:24:06,228 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 37 transitions. Word has length 4 [2019-03-04 16:24:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:06,229 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 37 transitions. [2019-03-04 16:24:06,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 37 transitions. [2019-03-04 16:24:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:06,230 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:06,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:06,230 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-03-04 16:24:06,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:06,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:06,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:06,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:06,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:06,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:06,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:06,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:06,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:06,439 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,448 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,458 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,465 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,480 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,481 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:06,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:06,537 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,554 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,554 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:06,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:06,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:06,585 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:06,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:06,641 INFO L87 Difference]: Start difference. First operand 15 states and 37 transitions. Second operand 8 states. [2019-03-04 16:24:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:06,962 INFO L93 Difference]: Finished difference Result 34 states and 66 transitions. [2019-03-04 16:24:06,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:06,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:06,963 INFO L225 Difference]: With dead ends: 34 [2019-03-04 16:24:06,963 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:24:06,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:24:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2019-03-04 16:24:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 42 transitions. [2019-03-04 16:24:06,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 42 transitions. Word has length 4 [2019-03-04 16:24:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:06,971 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 42 transitions. [2019-03-04 16:24:06,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 42 transitions. [2019-03-04 16:24:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:06,972 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:06,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:06,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-03-04 16:24:06,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:06,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:06,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:06,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:07,087 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:07,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:07,112 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:07,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:07,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:07,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:07,193 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,206 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,219 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,228 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:07,244 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:07,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:07,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:07,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:07,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:07,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:07,417 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,439 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:07,439 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:07,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:07,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:07,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:07,658 INFO L87 Difference]: Start difference. First operand 16 states and 42 transitions. Second operand 8 states. [2019-03-04 16:24:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,101 INFO L93 Difference]: Finished difference Result 36 states and 68 transitions. [2019-03-04 16:24:08,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:08,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,102 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:24:08,102 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:08,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 16. [2019-03-04 16:24:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 42 transitions. [2019-03-04 16:24:08,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 42 transitions. Word has length 4 [2019-03-04 16:24:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,108 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 42 transitions. [2019-03-04 16:24:08,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 42 transitions. [2019-03-04 16:24:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:08,109 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:08,109 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,109 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 2 times [2019-03-04 16:24:08,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,203 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-03-04 16:24:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:08,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:08,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:08,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:08,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:08,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,252 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:08,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,270 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:08,270 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,283 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,294 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,305 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:08,323 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:08,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:08,373 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,389 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:08,390 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:08,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,466 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:08,467 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:08,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:08,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:08,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:08,522 INFO L87 Difference]: Start difference. First operand 16 states and 42 transitions. Second operand 8 states. [2019-03-04 16:24:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:08,767 INFO L93 Difference]: Finished difference Result 43 states and 82 transitions. [2019-03-04 16:24:08,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:08,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:08,768 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:24:08,768 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:24:08,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:24:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 20. [2019-03-04 16:24:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:24:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2019-03-04 16:24:08,777 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 55 transitions. Word has length 4 [2019-03-04 16:24:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:08,777 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 55 transitions. [2019-03-04 16:24:08,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 55 transitions. [2019-03-04 16:24:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:08,777 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:08,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:08,778 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:08,778 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-03-04 16:24:08,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:08,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:08,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:08,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:08,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:08,869 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-03-04 16:24:08,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:08,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:08,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:08,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:08,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:08,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:08,964 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,970 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,978 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,987 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,002 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,003 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:09,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:09,032 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,046 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,047 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:09,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:09,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:09,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:09,086 INFO L87 Difference]: Start difference. First operand 20 states and 55 transitions. Second operand 6 states. [2019-03-04 16:24:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,222 INFO L93 Difference]: Finished difference Result 28 states and 65 transitions. [2019-03-04 16:24:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:09,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,223 INFO L225 Difference]: With dead ends: 28 [2019-03-04 16:24:09,223 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:24:09,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:24:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-03-04 16:24:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:24:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-03-04 16:24:09,231 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 4 [2019-03-04 16:24:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,232 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-03-04 16:24:09,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-03-04 16:24:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:09,232 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:09,233 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,233 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-03-04 16:24:09,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:09,331 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:09,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:09,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:09,380 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:09,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:09,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:09,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:09,492 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,503 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,512 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,524 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,538 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:09,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:09,599 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,613 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:09,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:09,676 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,690 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:09,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:09,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:09,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:09,723 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 8 states. [2019-03-04 16:24:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:10,123 INFO L93 Difference]: Finished difference Result 46 states and 97 transitions. [2019-03-04 16:24:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:10,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:10,125 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:24:10,125 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2019-03-04 16:24:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:24:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-03-04 16:24:10,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 4 [2019-03-04 16:24:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:10,135 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-03-04 16:24:10,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-03-04 16:24:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:10,135 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:10,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:10,136 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash 933772, now seen corresponding path program 1 times [2019-03-04 16:24:10,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,176 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-03-04 16:24:10,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:10,212 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:10,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:10,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:10,288 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,295 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,302 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,309 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,322 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:10,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:10,364 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,375 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:10,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:10,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:10,406 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-03-04 16:24:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:10,493 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-03-04 16:24:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:10,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:10,494 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:24:10,495 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:10,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-03-04 16:24:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-03-04 16:24:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 90 transitions. [2019-03-04 16:24:10,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 90 transitions. Word has length 4 [2019-03-04 16:24:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:10,505 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 90 transitions. [2019-03-04 16:24:10,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 90 transitions. [2019-03-04 16:24:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:10,506 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:10,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:10,506 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-03-04 16:24:10,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:10,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:10,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,633 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-03-04 16:24:10,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:10,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:10,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:10,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:10,683 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,699 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,726 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,733 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,747 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,747 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:10,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:10,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:10,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:10,928 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:10,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:10,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:10,979 INFO L87 Difference]: Start difference. First operand 27 states and 90 transitions. Second operand 8 states. [2019-03-04 16:24:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,261 INFO L93 Difference]: Finished difference Result 49 states and 127 transitions. [2019-03-04 16:24:11,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:11,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,263 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:24:11,263 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:24:11,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:11,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:24:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2019-03-04 16:24:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:24:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 107 transitions. [2019-03-04 16:24:11,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 107 transitions. Word has length 4 [2019-03-04 16:24:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,275 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 107 transitions. [2019-03-04 16:24:11,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 107 transitions. [2019-03-04 16:24:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:11,276 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:11,276 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash 937490, now seen corresponding path program 1 times [2019-03-04 16:24:11,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:11,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:11,433 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-03-04 16:24:11,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:11,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:11,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:11,454 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:11,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:11,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:11,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:11,487 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,496 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,505 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,515 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,531 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:11,531 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:11,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:11,571 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,586 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:11,586 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:11,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:11,617 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,635 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:11,636 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:11,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:11,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:11,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:11,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:11,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:11,673 INFO L87 Difference]: Start difference. First operand 32 states and 107 transitions. Second operand 8 states. [2019-03-04 16:24:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:12,038 INFO L93 Difference]: Finished difference Result 56 states and 145 transitions. [2019-03-04 16:24:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:12,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:12,039 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:12,039 INFO L226 Difference]: Without dead ends: 53 [2019-03-04 16:24:12,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-03-04 16:24:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2019-03-04 16:24:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:24:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 124 transitions. [2019-03-04 16:24:12,051 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 124 transitions. Word has length 4 [2019-03-04 16:24:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:12,051 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 124 transitions. [2019-03-04 16:24:12,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 124 transitions. [2019-03-04 16:24:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:12,051 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:12,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:12,052 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-03-04 16:24:12,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:12,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,153 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:12,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:12,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:12,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:12,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:12,233 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,243 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,250 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,259 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,271 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:12,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:12,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,310 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,311 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:24:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:12,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:12,347 INFO L87 Difference]: Start difference. First operand 36 states and 124 transitions. Second operand 6 states. [2019-03-04 16:24:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:12,735 INFO L93 Difference]: Finished difference Result 44 states and 130 transitions. [2019-03-04 16:24:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:12,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:12,736 INFO L225 Difference]: With dead ends: 44 [2019-03-04 16:24:12,736 INFO L226 Difference]: Without dead ends: 43 [2019-03-04 16:24:12,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-03-04 16:24:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-03-04 16:24:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:24:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-03-04 16:24:12,746 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 4 [2019-03-04 16:24:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:12,747 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-03-04 16:24:12,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-03-04 16:24:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:12,747 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:12,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:12,748 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash 29125732, now seen corresponding path program 1 times [2019-03-04 16:24:12,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:12,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,808 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-03-04 16:24:12,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,835 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:12,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:12,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:24:12,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:24:12,951 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,958 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,969 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,976 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,985 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,985 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:24:13,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:13,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,012 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:13,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:13,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:13,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:13,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:13,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:13,045 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 6 states. [2019-03-04 16:24:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:13,133 INFO L93 Difference]: Finished difference Result 44 states and 130 transitions. [2019-03-04 16:24:13,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:13,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:13,135 INFO L225 Difference]: With dead ends: 44 [2019-03-04 16:24:13,135 INFO L226 Difference]: Without dead ends: 43 [2019-03-04 16:24:13,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-03-04 16:24:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-03-04 16:24:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:24:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-03-04 16:24:13,146 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-03-04 16:24:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:13,147 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-03-04 16:24:13,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-03-04 16:24:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:13,148 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:13,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:13,148 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-03-04 16:24:13,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:13,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:13,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:13,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:13,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:13,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:13,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:13,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:13,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:13,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:13,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:13,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:13,320 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,328 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,337 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,343 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,358 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,358 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:13,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:13,386 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:13,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:13,425 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,440 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,440 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:13,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:13,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:13,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:13,485 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 8 states. [2019-03-04 16:24:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:13,795 INFO L93 Difference]: Finished difference Result 56 states and 145 transitions. [2019-03-04 16:24:13,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:13,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:13,797 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:13,797 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:24:13,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:24:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2019-03-04 16:24:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:24:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-03-04 16:24:13,809 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 5 [2019-03-04 16:24:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:13,810 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-03-04 16:24:13,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-03-04 16:24:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:13,810 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:13,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:13,811 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-03-04 16:24:13,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,082 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:24:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:14,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:14,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:14,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:14,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:14,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,144 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:14,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:14,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,162 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:14,163 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,171 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,178 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,186 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,200 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:14,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:14,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,238 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:14,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:14,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:14,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:14,331 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,346 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:14,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:14,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:14,383 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 10 states. [2019-03-04 16:24:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:14,811 INFO L93 Difference]: Finished difference Result 67 states and 195 transitions. [2019-03-04 16:24:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:14,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:14,812 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:24:14,813 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:24:14,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:24:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2019-03-04 16:24:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:24:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 147 transitions. [2019-03-04 16:24:14,826 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 147 transitions. Word has length 5 [2019-03-04 16:24:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:14,826 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 147 transitions. [2019-03-04 16:24:14,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 147 transitions. [2019-03-04 16:24:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:14,827 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:14,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:14,827 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:14,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-03-04 16:24:14,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,090 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:24:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:15,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:15,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:15,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:15,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:15,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:15,174 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,180 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,187 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,193 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,206 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,206 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:15,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:15,338 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,378 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:15,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:15,414 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,428 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,429 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:24:15,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:15,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:15,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:15,463 INFO L87 Difference]: Start difference. First operand 40 states and 147 transitions. Second operand 8 states. [2019-03-04 16:24:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,710 INFO L93 Difference]: Finished difference Result 61 states and 170 transitions. [2019-03-04 16:24:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:15,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,712 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:24:15,712 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:24:15,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:24:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-03-04 16:24:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:24:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 147 transitions. [2019-03-04 16:24:15,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 147 transitions. Word has length 5 [2019-03-04 16:24:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,724 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 147 transitions. [2019-03-04 16:24:15,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 147 transitions. [2019-03-04 16:24:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:15,725 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:15,725 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash 29119590, now seen corresponding path program 1 times [2019-03-04 16:24:15,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:15,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:15,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:15,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:15,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:15,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:15,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:15,922 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,930 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,938 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,947 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,959 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,959 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:15,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:15,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,000 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:16,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:16,038 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,053 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,053 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:16,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:16,111 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,125 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:16,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:16,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:16,170 INFO L87 Difference]: Start difference. First operand 40 states and 147 transitions. Second operand 10 states. [2019-03-04 16:24:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,600 INFO L93 Difference]: Finished difference Result 70 states and 195 transitions. [2019-03-04 16:24:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:16,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,602 INFO L225 Difference]: With dead ends: 70 [2019-03-04 16:24:16,602 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:16,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2019-03-04 16:24:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:24:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-03-04 16:24:16,621 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-03-04 16:24:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,621 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-03-04 16:24:16,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-03-04 16:24:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:16,622 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:16,622 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-03-04 16:24:16,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:16,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:16,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:16,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:16,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:16,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:16,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:16,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:16,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:16,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:16,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:16,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:16,848 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,857 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,863 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,870 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,883 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,884 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:16,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,914 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:16,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,927 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,927 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:16,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:16,956 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,970 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,971 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:16,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:17,002 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:17,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:17,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:17,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:17,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:17,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:17,466 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-03-04 16:24:18,306 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-03-04 16:24:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,905 INFO L93 Difference]: Finished difference Result 70 states and 185 transitions. [2019-03-04 16:24:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:18,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,908 INFO L225 Difference]: With dead ends: 70 [2019-03-04 16:24:18,908 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:18,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 30. [2019-03-04 16:24:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:24:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 96 transitions. [2019-03-04 16:24:18,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 96 transitions. Word has length 5 [2019-03-04 16:24:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,919 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 96 transitions. [2019-03-04 16:24:18,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 96 transitions. [2019-03-04 16:24:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:18,920 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:18,920 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-03-04 16:24:18,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,149 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:24:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:24:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:24:19,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:24:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:19,158 INFO L87 Difference]: Start difference. First operand 30 states and 96 transitions. Second operand 4 states. [2019-03-04 16:24:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:19,199 INFO L93 Difference]: Finished difference Result 38 states and 107 transitions. [2019-03-04 16:24:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:19,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:24:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:19,200 INFO L225 Difference]: With dead ends: 38 [2019-03-04 16:24:19,200 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:19,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-03-04 16:24:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:24:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 100 transitions. [2019-03-04 16:24:19,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 100 transitions. Word has length 5 [2019-03-04 16:24:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:19,210 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 100 transitions. [2019-03-04 16:24:19,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:24:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 100 transitions. [2019-03-04 16:24:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:19,211 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:19,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:19,211 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-03-04 16:24:19,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:19,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:19,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:19,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:19,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:19,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,301 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:19,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:19,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,324 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:19,324 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,351 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,358 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,366 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,378 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,379 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:19,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:19,401 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,414 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:19,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:19,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,459 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,459 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:19,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:19,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:19,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:19,522 INFO L87 Difference]: Start difference. First operand 31 states and 100 transitions. Second operand 8 states. [2019-03-04 16:24:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:19,736 INFO L93 Difference]: Finished difference Result 46 states and 126 transitions. [2019-03-04 16:24:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:19,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:19,737 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:24:19,737 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:19,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-03-04 16:24:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:24:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2019-03-04 16:24:19,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 110 transitions. Word has length 5 [2019-03-04 16:24:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:19,750 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 110 transitions. [2019-03-04 16:24:19,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 110 transitions. [2019-03-04 16:24:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:19,751 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:19,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:19,751 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:19,752 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-03-04 16:24:19,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:19,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:19,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:19,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:19,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:19,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:19,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:19,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,954 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:20,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:20,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:20,076 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,084 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,092 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,123 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,138 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,138 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:20,340 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-03-04 16:24:20,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,500 INFO L301 Elim1Store]: Index analysis took 126 ms [2019-03-04 16:24:20,501 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:20,501 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,706 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,706 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:20,935 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-03-04 16:24:20,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,109 INFO L301 Elim1Store]: Index analysis took 145 ms [2019-03-04 16:24:21,111 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:21,111 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:21,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:21,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:21,545 INFO L87 Difference]: Start difference. First operand 33 states and 110 transitions. Second operand 8 states. [2019-03-04 16:24:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:21,893 INFO L93 Difference]: Finished difference Result 51 states and 143 transitions. [2019-03-04 16:24:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:21,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:21,895 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:24:21,895 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:24:21,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:24:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2019-03-04 16:24:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:24:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 125 transitions. [2019-03-04 16:24:21,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 125 transitions. Word has length 5 [2019-03-04 16:24:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:21,906 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 125 transitions. [2019-03-04 16:24:21,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 125 transitions. [2019-03-04 16:24:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:21,907 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:21,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:21,907 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 29061806, now seen corresponding path program 1 times [2019-03-04 16:24:21,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:21,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:22,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:22,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:22,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:22,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,034 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:22,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:22,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,078 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:22,079 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,089 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,114 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,123 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,140 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,140 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:22,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:22,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,197 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:22,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,226 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:22,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:22,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:22,273 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,289 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:22,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:22,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:22,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:22,328 INFO L87 Difference]: Start difference. First operand 36 states and 125 transitions. Second operand 10 states. [2019-03-04 16:24:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:22,716 INFO L93 Difference]: Finished difference Result 62 states and 172 transitions. [2019-03-04 16:24:22,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:22,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:22,717 INFO L225 Difference]: With dead ends: 62 [2019-03-04 16:24:22,718 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:24:22,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:24:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2019-03-04 16:24:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:24:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 130 transitions. [2019-03-04 16:24:22,728 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 130 transitions. Word has length 5 [2019-03-04 16:24:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:22,729 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 130 transitions. [2019-03-04 16:24:22,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 130 transitions. [2019-03-04 16:24:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:22,729 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:22,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:22,729 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-03-04 16:24:22,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:22,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:22,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:22,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:24:22,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:22,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:23,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:23,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:24:23,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,346 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:24:23,347 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,354 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,360 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,367 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,376 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-03-04 16:24:23,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:23,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,405 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,405 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:24:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:23,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:23,432 INFO L87 Difference]: Start difference. First operand 37 states and 130 transitions. Second operand 6 states. [2019-03-04 16:24:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:23,501 INFO L93 Difference]: Finished difference Result 49 states and 158 transitions. [2019-03-04 16:24:23,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:23,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:23,502 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:24:23,502 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:24:23,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:24:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-03-04 16:24:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:24:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 150 transitions. [2019-03-04 16:24:23,516 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 150 transitions. Word has length 5 [2019-03-04 16:24:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:23,516 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 150 transitions. [2019-03-04 16:24:23,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 150 transitions. [2019-03-04 16:24:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:23,517 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:23,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:23,517 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:23,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:23,517 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 2 times [2019-03-04 16:24:23,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:23,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:23,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:23,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:23,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:23,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:23,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:23,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:23,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:23,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:23,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:23,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:23,699 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,816 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,928 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,937 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,951 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,951 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:23,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:23,976 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,996 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:24,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:24,022 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,038 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:24,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:24,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,077 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:24,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:24,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:24,113 INFO L87 Difference]: Start difference. First operand 40 states and 150 transitions. Second operand 10 states. [2019-03-04 16:24:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:24,521 INFO L93 Difference]: Finished difference Result 73 states and 201 transitions. [2019-03-04 16:24:24,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:24,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:24,523 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:24:24,523 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:24:24,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:24:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-03-04 16:24:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:24:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 164 transitions. [2019-03-04 16:24:24,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 164 transitions. Word has length 5 [2019-03-04 16:24:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:24,538 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 164 transitions. [2019-03-04 16:24:24,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 164 transitions. [2019-03-04 16:24:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:24,539 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:24,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:24,539 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 29056476, now seen corresponding path program 1 times [2019-03-04 16:24:24,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:24,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:24,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:24,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:24,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:24,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:24,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:24,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:24,687 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,695 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,703 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,711 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,725 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,725 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:24,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:24,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,761 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:24:24,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:24,777 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,787 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,788 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:24,818 INFO L87 Difference]: Start difference. First operand 43 states and 164 transitions. Second operand 8 states. [2019-03-04 16:24:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:25,255 INFO L93 Difference]: Finished difference Result 63 states and 209 transitions. [2019-03-04 16:24:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:25,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:25,256 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:25,256 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:24:25,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:24:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-03-04 16:24:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:24:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 191 transitions. [2019-03-04 16:24:25,273 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 191 transitions. Word has length 5 [2019-03-04 16:24:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 191 transitions. [2019-03-04 16:24:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 191 transitions. [2019-03-04 16:24:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:25,274 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:25,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:25,274 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash 29056040, now seen corresponding path program 1 times [2019-03-04 16:24:25,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:25,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:25,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:25,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:25,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:25,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:25,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:25,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:25,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,421 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:25,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:25,440 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,447 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,456 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,463 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,477 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,478 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:25,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:25,505 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,519 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:25,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:25,544 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,564 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:25,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:25,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,604 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:25,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:25,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:25,639 INFO L87 Difference]: Start difference. First operand 48 states and 191 transitions. Second operand 10 states. [2019-03-04 16:24:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,026 INFO L93 Difference]: Finished difference Result 76 states and 254 transitions. [2019-03-04 16:24:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:26,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,027 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:24:26,028 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:24:26,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:24:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2019-03-04 16:24:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:24:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 204 transitions. [2019-03-04 16:24:26,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 204 transitions. Word has length 5 [2019-03-04 16:24:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,044 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 204 transitions. [2019-03-04 16:24:26,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 204 transitions. [2019-03-04 16:24:26,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:26,044 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:26,045 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,045 INFO L82 PathProgramCache]: Analyzing trace with hash 902897748, now seen corresponding path program 1 times [2019-03-04 16:24:26,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:26,167 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:26,188 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:24:26,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:24:26,228 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,235 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,242 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,250 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,256 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,257 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-03-04 16:24:26,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:24:26,262 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,263 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,263 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:24:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:24:26,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:24:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:24:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:26,288 INFO L87 Difference]: Start difference. First operand 51 states and 204 transitions. Second operand 5 states. [2019-03-04 16:24:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,347 INFO L93 Difference]: Finished difference Result 63 states and 223 transitions. [2019-03-04 16:24:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:26,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-03-04 16:24:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,349 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:26,350 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:24:26,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:24:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-03-04 16:24:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:24:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 210 transitions. [2019-03-04 16:24:26,370 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 210 transitions. Word has length 6 [2019-03-04 16:24:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,370 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 210 transitions. [2019-03-04 16:24:26,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:24:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 210 transitions. [2019-03-04 16:24:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:26,371 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:26,371 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-03-04 16:24:26,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:26,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:26,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:26,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:26,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:26,612 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,620 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,628 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,636 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,651 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,651 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:26,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:26,675 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,689 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:26,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:26,819 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,833 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:26,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:26,875 INFO L87 Difference]: Start difference. First operand 54 states and 210 transitions. Second operand 8 states. [2019-03-04 16:24:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:27,130 INFO L93 Difference]: Finished difference Result 67 states and 229 transitions. [2019-03-04 16:24:27,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:27,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:27,131 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:24:27,131 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:24:27,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:24:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2019-03-04 16:24:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:24:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 210 transitions. [2019-03-04 16:24:27,151 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 210 transitions. Word has length 6 [2019-03-04 16:24:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:27,151 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 210 transitions. [2019-03-04 16:24:27,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 210 transitions. [2019-03-04 16:24:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:27,152 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:27,153 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:27,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-03-04 16:24:27,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:27,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:27,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:27,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:27,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:27,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:27,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:27,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:27,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:27,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:27,343 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,360 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,368 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,399 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:27,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:27,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,437 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,437 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:27,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:27,459 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,522 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:27,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:27,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,565 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,565 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:27,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:27,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:27,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:27,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:27,604 INFO L87 Difference]: Start difference. First operand 54 states and 210 transitions. Second operand 10 states. [2019-03-04 16:24:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:27,969 INFO L93 Difference]: Finished difference Result 81 states and 253 transitions. [2019-03-04 16:24:27,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:27,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:27,970 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:24:27,970 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:24:27,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:24:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2019-03-04 16:24:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-03-04 16:24:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 224 transitions. [2019-03-04 16:24:27,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 224 transitions. Word has length 6 [2019-03-04 16:24:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:27,989 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 224 transitions. [2019-03-04 16:24:27,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 224 transitions. [2019-03-04 16:24:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:27,990 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:27,990 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-03-04 16:24:27,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,213 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-03-04 16:24:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:28,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:28,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:28,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:28,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:28,257 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:28,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:28,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:28,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:28,276 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,284 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,292 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,300 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,313 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:28,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:28,340 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,354 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:28,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:28,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:28,391 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:28,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:28,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:28,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,452 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:28,452 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:28,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:28,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:28,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:28,490 INFO L87 Difference]: Start difference. First operand 57 states and 224 transitions. Second operand 10 states. [2019-03-04 16:24:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:28,845 INFO L93 Difference]: Finished difference Result 79 states and 257 transitions. [2019-03-04 16:24:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:28,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:28,847 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:24:28,847 INFO L226 Difference]: Without dead ends: 78 [2019-03-04 16:24:28,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-03-04 16:24:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2019-03-04 16:24:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:24:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 229 transitions. [2019-03-04 16:24:28,868 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 229 transitions. Word has length 6 [2019-03-04 16:24:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:28,869 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 229 transitions. [2019-03-04 16:24:28,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 229 transitions. [2019-03-04 16:24:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:28,869 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:28,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:28,870 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 902597852, now seen corresponding path program 1 times [2019-03-04 16:24:28,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,132 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:24:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:29,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:29,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:29,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:29,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:29,242 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,250 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,258 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,266 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,278 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:29,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:29,306 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:29,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:29,336 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,346 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:24:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:29,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:29,383 INFO L87 Difference]: Start difference. First operand 58 states and 229 transitions. Second operand 8 states. [2019-03-04 16:24:29,552 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-03-04 16:24:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:29,713 INFO L93 Difference]: Finished difference Result 68 states and 242 transitions. [2019-03-04 16:24:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:29,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:29,714 INFO L225 Difference]: With dead ends: 68 [2019-03-04 16:24:29,715 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:24:29,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:24:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-03-04 16:24:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:24:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 226 transitions. [2019-03-04 16:24:29,744 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 226 transitions. Word has length 6 [2019-03-04 16:24:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:29,744 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 226 transitions. [2019-03-04 16:24:29,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 226 transitions. [2019-03-04 16:24:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:29,745 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:29,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:29,745 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-03-04 16:24:29,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:29,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:29,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:29,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:29,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:29,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:29,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:29,959 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,965 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,972 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,980 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,989 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,990 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:30,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,020 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:30,020 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,031 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:30,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:30,052 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,062 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-03-04 16:24:30,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-03-04 16:24:30,085 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-03-04 16:24:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:30,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:30,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:30,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:30,129 INFO L87 Difference]: Start difference. First operand 56 states and 226 transitions. Second operand 10 states. [2019-03-04 16:24:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:30,472 INFO L93 Difference]: Finished difference Result 80 states and 256 transitions. [2019-03-04 16:24:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:30,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:30,474 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:24:30,475 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:24:30,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:24:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2019-03-04 16:24:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:24:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 201 transitions. [2019-03-04 16:24:30,494 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 201 transitions. Word has length 6 [2019-03-04 16:24:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:30,495 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 201 transitions. [2019-03-04 16:24:30,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 201 transitions. [2019-03-04 16:24:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:30,495 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:30,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:30,495 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 902717016, now seen corresponding path program 1 times [2019-03-04 16:24:30,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:30,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,685 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:24:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:30,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:30,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:30,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:30,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:30,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:30,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:30,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:24:30,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:24:30,781 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,789 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,796 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,804 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,815 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:24:30,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:30,834 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,839 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,840 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:30,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:24:30,851 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,857 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:24:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:30,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:30,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:30,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:30,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:30,888 INFO L87 Difference]: Start difference. First operand 51 states and 201 transitions. Second operand 8 states. [2019-03-04 16:24:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:31,536 INFO L93 Difference]: Finished difference Result 71 states and 253 transitions. [2019-03-04 16:24:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:31,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:31,538 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:24:31,538 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:24:31,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:24:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2019-03-04 16:24:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:24:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 217 transitions. [2019-03-04 16:24:31,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 217 transitions. Word has length 6 [2019-03-04 16:24:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:31,567 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 217 transitions. [2019-03-04 16:24:31,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 217 transitions. [2019-03-04 16:24:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:31,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:31,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:31,570 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 1 times [2019-03-04 16:24:31,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:31,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:31,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:31,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:31,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:31,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:31,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:31,831 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:31,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:31,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:31,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:31,867 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,875 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,883 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,891 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,903 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,904 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:31,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:31,935 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,949 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:31,949 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:31,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,978 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:31,979 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,993 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:31,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:32,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:32,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,037 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:32,038 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:32,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,187 INFO L301 Elim1Store]: Index analysis took 110 ms [2019-03-04 16:24:32,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:32,188 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,247 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:32,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:32,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:32,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:32,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:32,285 INFO L87 Difference]: Start difference. First operand 54 states and 217 transitions. Second operand 12 states. [2019-03-04 16:24:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:33,352 INFO L93 Difference]: Finished difference Result 96 states and 300 transitions. [2019-03-04 16:24:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:33,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:24:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:33,354 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:24:33,354 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:24:33,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:24:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 50. [2019-03-04 16:24:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:24:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 196 transitions. [2019-03-04 16:24:33,379 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 196 transitions. Word has length 6 [2019-03-04 16:24:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:33,379 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 196 transitions. [2019-03-04 16:24:33,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 196 transitions. [2019-03-04 16:24:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:33,380 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:33,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:33,381 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-03-04 16:24:33,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:33,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:33,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:33,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:33,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:33,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:33,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:33,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:33,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:33,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:33,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:33,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:33,590 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,598 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,606 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,614 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,628 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:33,628 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:33,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:33,656 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,667 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:33,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:33,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:33,706 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,720 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:33,720 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:33,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:33,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:24:33,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:24:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:24:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:33,759 INFO L87 Difference]: Start difference. First operand 50 states and 196 transitions. Second operand 7 states. [2019-03-04 16:24:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:33,958 INFO L93 Difference]: Finished difference Result 64 states and 221 transitions. [2019-03-04 16:24:33,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:33,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-03-04 16:24:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:33,960 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:24:33,960 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:24:33,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:24:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-03-04 16:24:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:24:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 211 transitions. [2019-03-04 16:24:33,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 211 transitions. Word has length 6 [2019-03-04 16:24:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:33,983 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 211 transitions. [2019-03-04 16:24:33,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:24:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 211 transitions. [2019-03-04 16:24:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:33,983 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:33,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:33,983 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-03-04 16:24:33,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:33,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:33,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:34,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:34,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:34,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:34,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:34,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:34,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:34,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,137 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:34,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,144 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:34,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:34,154 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,161 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,170 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,177 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,191 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:34,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:34,219 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,233 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,233 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:34,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:34,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,289 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:34,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:34,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:34,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:34,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:34,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:34,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:34,371 INFO L87 Difference]: Start difference. First operand 53 states and 211 transitions. Second operand 10 states. [2019-03-04 16:24:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:34,906 INFO L93 Difference]: Finished difference Result 97 states and 333 transitions. [2019-03-04 16:24:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:34,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:34,908 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:24:34,908 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:24:34,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:24:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2019-03-04 16:24:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 281 transitions. [2019-03-04 16:24:34,941 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 281 transitions. Word has length 6 [2019-03-04 16:24:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 281 transitions. [2019-03-04 16:24:34,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 281 transitions. [2019-03-04 16:24:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:34,941 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:34,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:34,942 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash 897356622, now seen corresponding path program 1 times [2019-03-04 16:24:34,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:34,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:34,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:35,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:35,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:35,046 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:35,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:35,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:35,076 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,083 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,089 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,097 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,110 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,110 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:35,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,134 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:35,134 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,145 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,145 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:35,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:35,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:35,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:35,175 INFO L87 Difference]: Start difference. First operand 67 states and 281 transitions. Second operand 6 states. [2019-03-04 16:24:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:35,312 INFO L93 Difference]: Finished difference Result 75 states and 292 transitions. [2019-03-04 16:24:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:35,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-03-04 16:24:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:35,314 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:24:35,314 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:24:35,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:24:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-03-04 16:24:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 280 transitions. [2019-03-04 16:24:35,344 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 280 transitions. Word has length 6 [2019-03-04 16:24:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:35,344 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 280 transitions. [2019-03-04 16:24:35,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 280 transitions. [2019-03-04 16:24:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:35,345 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:35,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:35,345 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-03-04 16:24:35,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,647 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-03-04 16:24:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:35,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:35,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:35,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:35,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:35,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:35,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:35,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:35,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:35,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,715 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:35,716 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,724 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,732 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,740 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,753 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:35,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:35,782 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,796 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:35,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:35,833 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:35,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:35,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,904 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,904 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:35,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:35,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:35,943 INFO L87 Difference]: Start difference. First operand 67 states and 280 transitions. Second operand 10 states. [2019-03-04 16:24:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:36,299 INFO L93 Difference]: Finished difference Result 116 states and 393 transitions. [2019-03-04 16:24:36,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:36,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:36,301 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:24:36,301 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:24:36,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:24:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2019-03-04 16:24:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:24:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 286 transitions. [2019-03-04 16:24:36,333 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 286 transitions. Word has length 6 [2019-03-04 16:24:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:36,333 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 286 transitions. [2019-03-04 16:24:36,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 286 transitions. [2019-03-04 16:24:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:36,334 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:36,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:36,334 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash 897175890, now seen corresponding path program 1 times [2019-03-04 16:24:36,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:36,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:36,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:36,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:36,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:36,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:36,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:36,493 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:36,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:36,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:36,531 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,538 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,545 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,552 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,565 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,565 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:36,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:36,594 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:36,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:36,620 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,630 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,630 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:24:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:36,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:36,665 INFO L87 Difference]: Start difference. First operand 68 states and 286 transitions. Second operand 8 states. [2019-03-04 16:24:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:36,875 INFO L93 Difference]: Finished difference Result 84 states and 320 transitions. [2019-03-04 16:24:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:36,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:36,877 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:24:36,877 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:24:36,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:24:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2019-03-04 16:24:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:24:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 295 transitions. [2019-03-04 16:24:36,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 295 transitions. Word has length 6 [2019-03-04 16:24:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:36,908 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 295 transitions. [2019-03-04 16:24:36,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 295 transitions. [2019-03-04 16:24:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:36,908 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:36,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:36,909 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 2 times [2019-03-04 16:24:36,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:36,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:37,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:37,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:37,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:37,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:37,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:37,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:37,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:37,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,121 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:37,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:37,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,140 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:37,141 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,149 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,157 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,166 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,180 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,180 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:37,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:37,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,222 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:37,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:37,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:37,250 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,265 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:37,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:37,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:37,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,307 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:37,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:37,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:37,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,354 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:37,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:37,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:37,393 INFO L87 Difference]: Start difference. First operand 70 states and 295 transitions. Second operand 12 states. [2019-03-04 16:24:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:37,967 INFO L93 Difference]: Finished difference Result 112 states and 388 transitions. [2019-03-04 16:24:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:37,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:24:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:37,969 INFO L225 Difference]: With dead ends: 112 [2019-03-04 16:24:37,969 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:24:37,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:24:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2019-03-04 16:24:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:24:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 303 transitions. [2019-03-04 16:24:38,002 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 303 transitions. Word has length 6 [2019-03-04 16:24:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,002 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 303 transitions. [2019-03-04 16:24:38,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 303 transitions. [2019-03-04 16:24:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:38,003 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:38,003 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-03-04 16:24:38,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:38,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:38,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:38,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:38,118 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:38,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,134 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:38,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:38,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:38,161 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,170 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,180 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,191 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,207 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,208 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:38,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,245 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:38,246 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,279 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:38,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:38,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:38,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:38,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:38,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:38,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:38,391 INFO L87 Difference]: Start difference. First operand 72 states and 303 transitions. Second operand 8 states. [2019-03-04 16:24:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:38,610 INFO L93 Difference]: Finished difference Result 86 states and 320 transitions. [2019-03-04 16:24:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:38,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:24:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:38,612 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:24:38,612 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:24:38,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:24:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-03-04 16:24:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:24:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 302 transitions. [2019-03-04 16:24:38,648 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 302 transitions. Word has length 7 [2019-03-04 16:24:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,648 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 302 transitions. [2019-03-04 16:24:38,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 302 transitions. [2019-03-04 16:24:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:38,648 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:38,649 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-03-04 16:24:38,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:38,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:38,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:38,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:38,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:38,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,825 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:38,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:38,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:38,845 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,887 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,895 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,902 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,916 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,916 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:38,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:38,942 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,957 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:38,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,983 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:38,984 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,998 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:39,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,027 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:39,028 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,041 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:39,080 INFO L87 Difference]: Start difference. First operand 74 states and 302 transitions. Second operand 10 states. [2019-03-04 16:24:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:39,440 INFO L93 Difference]: Finished difference Result 85 states and 320 transitions. [2019-03-04 16:24:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:39,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:24:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:39,442 INFO L225 Difference]: With dead ends: 85 [2019-03-04 16:24:39,442 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:24:39,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:24:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-03-04 16:24:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:24:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 308 transitions. [2019-03-04 16:24:39,495 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 308 transitions. Word has length 7 [2019-03-04 16:24:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:39,495 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 308 transitions. [2019-03-04 16:24:39,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 308 transitions. [2019-03-04 16:24:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:39,496 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:39,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:39,496 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-03-04 16:24:39,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:39,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:39,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:39,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:39,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:39,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:39,771 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,779 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,787 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,795 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,807 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:39,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,831 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:39,831 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,845 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,845 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:39,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:39,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:39,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:39,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,996 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:40,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:40,027 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,041 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,041 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:40,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:40,082 INFO L87 Difference]: Start difference. First operand 74 states and 308 transitions. Second operand 12 states. [2019-03-04 16:24:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,592 INFO L93 Difference]: Finished difference Result 122 states and 439 transitions. [2019-03-04 16:24:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:40,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:24:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,594 INFO L225 Difference]: With dead ends: 122 [2019-03-04 16:24:40,594 INFO L226 Difference]: Without dead ends: 121 [2019-03-04 16:24:40,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:24:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-03-04 16:24:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2019-03-04 16:24:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:24:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 298 transitions. [2019-03-04 16:24:40,649 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 298 transitions. Word has length 7 [2019-03-04 16:24:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:40,649 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 298 transitions. [2019-03-04 16:24:40,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 298 transitions. [2019-03-04 16:24:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:40,650 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:40,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:40,650 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-03-04 16:24:40,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:40,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:40,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:40,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:40,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:40,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:40,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:40,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:40,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:40,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:40,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:40,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,937 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:40,937 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,946 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,954 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,962 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,976 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,976 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:40,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:41,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,017 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,018 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:41,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:41,046 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,060 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,060 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:41,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:41,089 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:41,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:41,193 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,208 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,208 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:24:41,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:24:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:24:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:41,250 INFO L87 Difference]: Start difference. First operand 72 states and 298 transitions. Second operand 11 states. [2019-03-04 16:24:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:41,717 INFO L93 Difference]: Finished difference Result 87 states and 322 transitions. [2019-03-04 16:24:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:41,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:24:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:41,719 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:24:41,720 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:41,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:24:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 39. [2019-03-04 16:24:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:24:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2019-03-04 16:24:41,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 146 transitions. Word has length 7 [2019-03-04 16:24:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:41,749 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 146 transitions. [2019-03-04 16:24:41,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:24:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 146 transitions. [2019-03-04 16:24:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:41,750 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:41,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:41,750 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-03-04 16:24:41,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:41,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:41,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:41,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:41,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:41,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:41,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:41,925 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,933 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,939 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,947 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,959 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,959 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:41,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:41,990 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,000 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,000 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:42,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:42,043 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,051 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:24:42,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,072 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-03-04 16:24:42,073 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-03-04 16:24:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:42,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:42,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:42,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:42,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:42,123 INFO L87 Difference]: Start difference. First operand 39 states and 146 transitions. Second operand 10 states. [2019-03-04 16:24:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,446 INFO L93 Difference]: Finished difference Result 67 states and 222 transitions. [2019-03-04 16:24:42,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:42,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:24:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,448 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:24:42,448 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:24:42,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:24:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2019-03-04 16:24:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:24:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2019-03-04 16:24:42,478 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 146 transitions. Word has length 7 [2019-03-04 16:24:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,478 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 146 transitions. [2019-03-04 16:24:42,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 146 transitions. [2019-03-04 16:24:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:42,479 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:42,479 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-03-04 16:24:42,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:42,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:42,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:42,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:42,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:42,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:42,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:42,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-03-04 16:24:42,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 22 treesize of output 27 [2019-03-04 16:24:42,655 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,665 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,671 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,679 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,688 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,689 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-03-04 16:24:42,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:42,710 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,716 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:42,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:24:42,729 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,734 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,734 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:24:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:42,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:42,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:24:42,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:24:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:24:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:42,768 INFO L87 Difference]: Start difference. First operand 39 states and 146 transitions. Second operand 9 states. [2019-03-04 16:24:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,997 INFO L93 Difference]: Finished difference Result 80 states and 263 transitions. [2019-03-04 16:24:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:42,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:24:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,998 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:24:42,998 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:24:42,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:24:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-03-04 16:24:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-03-04 16:24:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 229 transitions. [2019-03-04 16:24:43,063 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 229 transitions. Word has length 7 [2019-03-04 16:24:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:43,063 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 229 transitions. [2019-03-04 16:24:43,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:24:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 229 transitions. [2019-03-04 16:24:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:43,064 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:43,064 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:24:43,064 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 3 times [2019-03-04 16:24:43,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:43,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:43,358 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:24:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:43,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:43,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:43,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:24:43,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:24:43,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:43,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:43,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:43,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:43,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,573 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:43,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:43,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:43,636 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,668 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,675 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,682 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,696 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:43,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:43,727 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,738 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:43,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:43,767 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,782 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:43,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:43,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,827 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:43,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:43,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:43,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,037 INFO L301 Elim1Store]: Index analysis took 109 ms [2019-03-04 16:24:44,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:44,038 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,052 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:44,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:24:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:24:44,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:24:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:44,093 INFO L87 Difference]: Start difference. First operand 60 states and 229 transitions. Second operand 13 states. [2019-03-04 16:24:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:44,665 INFO L93 Difference]: Finished difference Result 72 states and 250 transitions. [2019-03-04 16:24:44,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:44,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:24:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:44,667 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:24:44,667 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:24:44,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:24:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:24:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-03-04 16:24:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:24:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 144 transitions. [2019-03-04 16:24:44,710 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 144 transitions. Word has length 7 [2019-03-04 16:24:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:44,710 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 144 transitions. [2019-03-04 16:24:44,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:24:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 144 transitions. [2019-03-04 16:24:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:44,711 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:44,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:44,711 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1929798576, now seen corresponding path program 1 times [2019-03-04 16:24:44,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:44,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:44,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:44,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:44,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:44,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:44,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:44,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:44,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:44,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:44,857 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,864 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,871 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,879 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,892 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:44,892 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:44,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:44,916 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,930 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:44,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:44,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:44,969 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:44,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:45,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:45,009 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,024 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,024 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:24:45,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:24:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:24:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:45,060 INFO L87 Difference]: Start difference. First operand 42 states and 144 transitions. Second operand 9 states. [2019-03-04 16:24:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:45,390 INFO L93 Difference]: Finished difference Result 71 states and 225 transitions. [2019-03-04 16:24:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:45,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:24:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:45,391 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:24:45,391 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:24:45,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:24:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-03-04 16:24:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:24:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 168 transitions. [2019-03-04 16:24:45,448 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 168 transitions. Word has length 7 [2019-03-04 16:24:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,449 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 168 transitions. [2019-03-04 16:24:45,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:24:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 168 transitions. [2019-03-04 16:24:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:45,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:45,449 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:45,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-03-04 16:24:45,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,942 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:24:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:46,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:46,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,119 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:46,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:46,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:46,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:46,140 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,148 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,156 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,164 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,179 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:46,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:46,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,263 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,264 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:46,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:46,287 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,302 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:46,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:24:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:24:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:24:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:46,337 INFO L87 Difference]: Start difference. First operand 48 states and 168 transitions. Second operand 7 states. [2019-03-04 16:24:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,579 INFO L93 Difference]: Finished difference Result 58 states and 188 transitions. [2019-03-04 16:24:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:46,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:24:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,581 INFO L225 Difference]: With dead ends: 58 [2019-03-04 16:24:46,581 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:24:46,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:24:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-03-04 16:24:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 172 transitions. [2019-03-04 16:24:46,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 172 transitions. Word has length 7 [2019-03-04 16:24:46,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,640 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 172 transitions. [2019-03-04 16:24:46,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:24:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 172 transitions. [2019-03-04 16:24:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:46,641 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:46,641 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 2 times [2019-03-04 16:24:46,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:46,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:46,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:46,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:46,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,835 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:46,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:46,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:46,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:46,855 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,863 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,870 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,877 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,891 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,892 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:46,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:46,919 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,933 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,933 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:46,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:46,959 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:46,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:47,001 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:47,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:47,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:47,066 INFO L87 Difference]: Start difference. First operand 49 states and 172 transitions. Second operand 10 states. [2019-03-04 16:24:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:47,533 INFO L93 Difference]: Finished difference Result 76 states and 233 transitions. [2019-03-04 16:24:47,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:47,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:24:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:47,535 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:24:47,535 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:24:47,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:24:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-03-04 16:24:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:24:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 189 transitions. [2019-03-04 16:24:47,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 189 transitions. Word has length 7 [2019-03-04 16:24:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:47,606 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 189 transitions. [2019-03-04 16:24:47,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 189 transitions. [2019-03-04 16:24:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:24:47,606 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:47,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:47,607 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2136254676, now seen corresponding path program 2 times [2019-03-04 16:24:47,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:47,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:47,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:47,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:47,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:47,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:47,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:47,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:47,804 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:47,821 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-03-04 16:24:47,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 20 treesize of output 25 [2019-03-04 16:24:47,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,863 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 24 [2019-03-04 16:24:47,864 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,871 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,878 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,886 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,899 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-03-04 16:24:47,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,929 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:47,930 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-03-04 16:24:47,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:47,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:47,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:47,994 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,005 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-03-04 16:24:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:48,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:48,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:24:48,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:24:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:24:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:48,043 INFO L87 Difference]: Start difference. First operand 53 states and 189 transitions. Second operand 11 states. [2019-03-04 16:24:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:48,517 INFO L93 Difference]: Finished difference Result 105 states and 330 transitions. [2019-03-04 16:24:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:24:48,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:24:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:48,518 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:24:48,519 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:24:48,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:24:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2019-03-04 16:24:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:24:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 212 transitions. [2019-03-04 16:24:48,626 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 212 transitions. Word has length 7 [2019-03-04 16:24:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,626 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 212 transitions. [2019-03-04 16:24:48,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:24:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 212 transitions. [2019-03-04 16:24:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:24:48,626 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:48,627 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -309661048, now seen corresponding path program 1 times [2019-03-04 16:24:48,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:48,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:48,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:48,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:48,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:48,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:48,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:48,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:48,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:48,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:48,838 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,846 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,854 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,863 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,876 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,876 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:48,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:48,933 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,947 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:48,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:48,974 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:49,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,016 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:49,017 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,029 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:49,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,059 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:49,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,072 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,072 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:49,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:49,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:49,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:49,113 INFO L87 Difference]: Start difference. First operand 58 states and 212 transitions. Second operand 12 states. [2019-03-04 16:24:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:49,728 INFO L93 Difference]: Finished difference Result 91 states and 299 transitions. [2019-03-04 16:24:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:49,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:24:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:49,729 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:24:49,729 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:24:49,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:24:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:24:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2019-03-04 16:24:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 251 transitions. [2019-03-04 16:24:49,852 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 251 transitions. Word has length 8 [2019-03-04 16:24:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:49,852 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 251 transitions. [2019-03-04 16:24:49,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 251 transitions. [2019-03-04 16:24:49,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:24:49,853 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:49,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:49,853 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-03-04 16:24:49,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:49,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:49,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:49,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:49,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:49,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:49,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:49,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:49,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:49,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,991 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:49,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:50,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:50,013 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,021 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,029 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,052 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,052 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:50,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,078 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:50,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,092 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:50,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:50,131 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,154 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:50,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:50,185 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,200 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:50,237 INFO L87 Difference]: Start difference. First operand 67 states and 251 transitions. Second operand 10 states. [2019-03-04 16:24:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:50,691 INFO L93 Difference]: Finished difference Result 98 states and 347 transitions. [2019-03-04 16:24:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:50,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:24:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:50,692 INFO L225 Difference]: With dead ends: 98 [2019-03-04 16:24:50,693 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:24:50,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:24:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2019-03-04 16:24:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:24:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 303 transitions. [2019-03-04 16:24:50,961 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 303 transitions. Word has length 8 [2019-03-04 16:24:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:50,961 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 303 transitions. [2019-03-04 16:24:50,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 303 transitions. [2019-03-04 16:24:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:24:50,962 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:50,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:50,962 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -475714096, now seen corresponding path program 1 times [2019-03-04 16:24:50,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:50,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:51,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:51,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:51,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:51,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:51,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:51,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:51,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:51,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:51,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,162 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:51,162 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,170 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,178 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,186 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,200 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:51,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:51,225 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,254 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:51,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:51,279 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,294 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:51,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:51,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,333 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:51,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:24:51,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:24:51,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:24:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:51,368 INFO L87 Difference]: Start difference. First operand 80 states and 303 transitions. Second operand 9 states. [2019-03-04 16:24:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,766 INFO L93 Difference]: Finished difference Result 90 states and 323 transitions. [2019-03-04 16:24:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:51,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:24:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,768 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:24:51,768 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:24:51,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:24:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-03-04 16:24:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:24:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 307 transitions. [2019-03-04 16:24:51,946 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 307 transitions. Word has length 8 [2019-03-04 16:24:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,947 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 307 transitions. [2019-03-04 16:24:51,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:24:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 307 transitions. [2019-03-04 16:24:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:24:51,947 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:51,947 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-03-04 16:24:51,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:51,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,099 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:24:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:24:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:52,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:52,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:52,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:52,176 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,184 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,192 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,200 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,213 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,213 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:52,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:52,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,256 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,256 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:52,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:52,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,299 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:52,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:52,326 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,529 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,529 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:52,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4] total 6 [2019-03-04 16:24:52,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:52,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:52,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:52,612 INFO L87 Difference]: Start difference. First operand 81 states and 307 transitions. Second operand 8 states. [2019-03-04 16:24:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:53,068 INFO L93 Difference]: Finished difference Result 93 states and 336 transitions. [2019-03-04 16:24:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:53,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-03-04 16:24:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:53,070 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:24:53,070 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:53,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-03-04 16:24:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:24:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 307 transitions. [2019-03-04 16:24:53,237 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 307 transitions. Word has length 8 [2019-03-04 16:24:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:53,237 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 307 transitions. [2019-03-04 16:24:53,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 307 transitions. [2019-03-04 16:24:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:24:53,238 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:53,238 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:53,238 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:53,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-03-04 16:24:53,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:53,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:53,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:53,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:53,576 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 12 [2019-03-04 16:24:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:24:53,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:53,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:53,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:53,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:53,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:53,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:53,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:53,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:53,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:53,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:53,674 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,683 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,690 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,698 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,712 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,712 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:53,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:53,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:53,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:53,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:53,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:53,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,835 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:53,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:53,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,878 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,878 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:53,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:53,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 8 [2019-03-04 16:24:53,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:53,928 INFO L87 Difference]: Start difference. First operand 81 states and 307 transitions. Second operand 10 states. [2019-03-04 16:24:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:54,638 INFO L93 Difference]: Finished difference Result 112 states and 402 transitions. [2019-03-04 16:24:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:54,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:24:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:54,640 INFO L225 Difference]: With dead ends: 112 [2019-03-04 16:24:54,640 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:24:54,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:24:54,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 60. [2019-03-04 16:24:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-03-04 16:24:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 215 transitions. [2019-03-04 16:24:54,767 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 215 transitions. Word has length 9 [2019-03-04 16:24:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:54,768 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 215 transitions. [2019-03-04 16:24:54,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 215 transitions. [2019-03-04 16:24:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:24:54,768 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:54,768 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:54,768 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:54,769 INFO L82 PathProgramCache]: Analyzing trace with hash -893494090, now seen corresponding path program 2 times [2019-03-04 16:24:54,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:54,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:54,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:54,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:55,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:55,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:55,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:55,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:55,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:55,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:55,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:55,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:55,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,039 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:55,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:55,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:55,055 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,063 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,070 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,077 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,090 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,090 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:55,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:55,117 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,131 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:55,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:55,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,179 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,180 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:55,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,209 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:55,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,224 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,224 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:55,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:55,255 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,269 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,269 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:55,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,301 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:55,301 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:55,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:55,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:24:55,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:24:55,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:24:55,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:24:55,359 INFO L87 Difference]: Start difference. First operand 60 states and 215 transitions. Second operand 14 states. [2019-03-04 16:24:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,977 INFO L93 Difference]: Finished difference Result 69 states and 233 transitions. [2019-03-04 16:24:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:55,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-03-04 16:24:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,978 INFO L225 Difference]: With dead ends: 69 [2019-03-04 16:24:55,978 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:24:55,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:24:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:24:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 17. [2019-03-04 16:24:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:24:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2019-03-04 16:24:56,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 49 transitions. Word has length 9 [2019-03-04 16:24:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:56,021 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 49 transitions. [2019-03-04 16:24:56,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:24:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 49 transitions. [2019-03-04 16:24:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:24:56,022 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:56,022 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:56,022 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-03-04 16:24:56,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:56,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:56,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:56,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:56,163 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:24:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:24:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:56,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:56,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:56,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:56,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:56,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:56,248 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:56,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:56,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,258 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:56,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:56,269 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,277 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,285 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,292 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,306 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,307 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:56,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:56,332 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,347 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:56,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:56,373 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:56,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:56,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,427 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,427 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:56,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:56,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,466 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,466 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:56,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:24:56,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:24:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:24:56,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:56,504 INFO L87 Difference]: Start difference. First operand 17 states and 49 transitions. Second operand 11 states. [2019-03-04 16:24:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:56,850 INFO L93 Difference]: Finished difference Result 31 states and 84 transitions. [2019-03-04 16:24:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:56,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:24:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:56,851 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:24:56,852 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:24:56,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:24:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-03-04 16:24:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:24:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2019-03-04 16:24:56,901 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 57 transitions. Word has length 9 [2019-03-04 16:24:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:56,901 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 57 transitions. [2019-03-04 16:24:56,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:24:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 57 transitions. [2019-03-04 16:24:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:24:56,902 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:56,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:56,902 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-03-04 16:24:56,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:56,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:56,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:56,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,182 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-03-04 16:24:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:57,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24: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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:57,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:57,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:57,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:57,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:57,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:57,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:57,358 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,366 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,374 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,395 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,395 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:57,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:57,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,437 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:57,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:57,469 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:57,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,513 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:57,513 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,528 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,528 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:57,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:57,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:57,556 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,570 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:57,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:57,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:57,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:57,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:57,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:57,610 INFO L87 Difference]: Start difference. First operand 19 states and 57 transitions. Second operand 12 states. [2019-03-04 16:24:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:58,021 INFO L93 Difference]: Finished difference Result 37 states and 100 transitions. [2019-03-04 16:24:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:58,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:24:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:58,023 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:24:58,023 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:24:58,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:24:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-03-04 16:24:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-03-04 16:24:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2019-03-04 16:24:58,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 43 transitions. Word has length 9 [2019-03-04 16:24:58,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:58,070 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 43 transitions. [2019-03-04 16:24:58,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 43 transitions. [2019-03-04 16:24:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:24:58,070 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:58,071 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:24:58,071 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-03-04 16:24:58,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:58,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:24:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:58,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:58,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:58,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:58,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:58,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:58,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2019-03-04 16:24:58,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-03-04 16:24:58,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-03-04 16:24:58,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-03-04 16:24:58,292 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,300 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,308 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,315 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,329 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,330 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-03-04 16:24:58,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:58,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,370 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,370 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:58,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:58,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:58,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:58,446 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,462 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,462 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:58,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:58,504 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:58,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:24:58,561 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,581 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:24:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:58,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:58,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 10 [2019-03-04 16:24:58,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:58,639 INFO L87 Difference]: Start difference. First operand 15 states and 43 transitions. Second operand 12 states. [2019-03-04 16:24:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:59,087 INFO L93 Difference]: Finished difference Result 24 states and 70 transitions. [2019-03-04 16:24:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:59,088 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 16:24:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:59,088 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:24:59,088 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:24:59,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:24:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:24:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:24:59,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:24:59,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-03-04 16:24:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:59,091 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:24:59,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:24:59,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:24:59,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:24:59,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:24:59,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:24:59,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:24:59,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:00,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:01,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:01,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:02,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:02,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:25:04,546 WARN L181 SmtUtils]: Spent 5.45 s on a formula simplification. DAG size of input: 968 DAG size of output: 701 [2019-03-04 16:25:14,470 WARN L181 SmtUtils]: Spent 9.92 s on a formula simplification. DAG size of input: 656 DAG size of output: 107 [2019-03-04 16:25:14,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:25:14,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-03-04 16:25:14,473 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-03-04 16:25:14,473 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-03-04 16:25:14,473 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-03-04 16:25:14,474 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse11 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse21 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse11 (- 1))))) (let ((.cse20 (select .cse21 ULTIMATE.start_main_p1)) (.cse12 (select .cse21 ULTIMATE.start_main_p3)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse18 1))) (.cse16 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse5 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse16 (- 1)))) (.cse0 (select .cse17 ULTIMATE.start_main_p4)) (.cse8 (= (select .cse21 ULTIMATE.start_main_p2) 0)) (.cse3 (= .cse12 0)) (.cse9 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse7 (<= 1 .cse20))) (let ((.cse4 (= .cse20 0)) (.cse2 (and (or (and (= .cse18 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))) .cse7) (<= .cse16 0))) (.cse15 (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (and .cse8 .cse7 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) .cse3 .cse9)) (.cse1 (<= (+ (select .cse17 ULTIMATE.start_main_p2) 1) 0)) (.cse13 (<= (+ .cse0 1) 0)) (.cse14 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse10 (= 0 (select .cse5 ULTIMATE.start_main_p1)))) (or (or (and (= .cse0 0) (and .cse1 .cse2) .cse3) (and .cse3 (and .cse4 (= 0 (select .cse5 ULTIMATE.start_main_p4)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))))) (and (let ((.cse6 (<= .cse11 0))) (or (and .cse6 .cse7 (or .cse8 .cse1)) (and .cse6 (or (and (and .cse8 .cse9) .cse10) (and .cse4 .cse1))))) (<= 1 .cse12)) (or (and .cse2 .cse1 .cse3 .cse13) (and .cse14 .cse15 .cse13)) (let ((.cse19 (= .cse11 0))) (or (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 .cse16) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse17 ULTIMATE.start_main_p3) 0) (= .cse18 0) .cse19 (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and .cse14 .cse15) .cse19))) (and (or (and .cse3 (and .cse1 .cse13 .cse10)) (and (and (<= (+ .cse11 1) 0) .cse8 .cse9) .cse14 .cse3 .cse10)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))))))))) [2019-03-04 16:25:14,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:25:14,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-03-04 16:25:14,474 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-03-04 16:25:14,474 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-03-04 16:25:14,474 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-03-04 16:25:14,500 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:25:14 BoogieIcfgContainer [2019-03-04 16:25:14,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:25:14,501 INFO L168 Benchmark]: Toolchain (without parser) took 73588.02 ms. Allocated memory was 141.0 MB in the beginning and 631.2 MB in the end (delta: 490.2 MB). Free memory was 108.5 MB in the beginning and 383.3 MB in the end (delta: -274.8 MB). Peak memory consumption was 534.7 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:14,502 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:25:14,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:14,502 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:14,503 INFO L168 Benchmark]: RCFGBuilder took 326.63 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:14,503 INFO L168 Benchmark]: TraceAbstraction took 73170.04 ms. Allocated memory was 141.0 MB in the beginning and 631.2 MB in the end (delta: 490.2 MB). Free memory was 94.3 MB in the beginning and 383.3 MB in the end (delta: -289.0 MB). Peak memory consumption was 520.5 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:14,505 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 141.0 MB. Free memory was 108.3 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.60 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 105.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 326.63 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73170.04 ms. Allocated memory was 141.0 MB in the beginning and 631.2 MB in the end (delta: 490.2 MB). Free memory was 94.3 MB in the beginning and 383.3 MB in the end (delta: -289.0 MB). Peak memory consumption was 520.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((#memory_int[p1 := #memory_int[p1] + 1][p4] == 0 && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && ((#memory_int[p1] == 1 && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p2 : int, ULTIMATE.start_main_p3 : int :: ((((ULTIMATE.start_main_p3 < ULTIMATE.start_main_p4 && #memory_int[ULTIMATE.start_main_p4] + 1 == 0) && 0 == #memory_int[ULTIMATE.start_main_p2] + 1) && #memory_int[ULTIMATE.start_main_p3] == 0) && ULTIMATE.start_main_p2 < ULTIMATE.start_main_p3) && p1 < ULTIMATE.start_main_p2)) || 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && #memory_int[p2] <= 0) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) || (#memory_int[p4 := #memory_int[p4] + -1][p3] == 0 && ((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p4]) && #memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0) && !(p1 == p3))) || ((((#memory_int[p4] <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && (#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 || #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)) || (#memory_int[p4] <= 0 && (((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && p1 + 3 <= p4) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)))) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((#memory_int[p1] == 1 && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p2 : int, ULTIMATE.start_main_p3 : int :: ((((ULTIMATE.start_main_p3 < ULTIMATE.start_main_p4 && #memory_int[ULTIMATE.start_main_p4] + 1 == 0) && 0 == #memory_int[ULTIMATE.start_main_p2] + 1) && #memory_int[ULTIMATE.start_main_p3] == 0) && ULTIMATE.start_main_p2 < ULTIMATE.start_main_p3) && p1 < ULTIMATE.start_main_p2)) || 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && #memory_int[p2] <= 0) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((!(p3 == p2) && ((!(p3 == p4) && (#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p2 == p4)) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && p1 + 3 <= p4) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || ((((((p3 < p4 && 0 == #memory_int[p2]) && p2 < p3) && #memory_int[p1 := #memory_int[p1] + 1][p3] == 0) && #memory_int[p1] == 0) && #memory_int[p4] == 0) && p1 < p2) || ((!(p3 == p2) && ((!(p3 == p4) && (#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p2 == p4)) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && p1 + 3 <= p4) && #memory_int[p4] == 0)) || (((#memory_int[p4 := #memory_int[p4] + -1][p3] == 0 && (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((((#memory_int[p4] + 1 <= 0 && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && p1 + 3 <= p4) && !(p3 == p2)) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 73.0s OverallTime, 64 OverallIterations, 2 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 15.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 904 SDslu, 1 SDs, 0 SdLazy, 9685 SolverSat, 659 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 98 SyntacticMatches, 42 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 64 MinimizatonAttempts, 1118 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 39 NumberOfFragments, 658 HoareAnnotationTreeSize, 1 FomulaSimplifications, 1690038819 FormulaSimplificationTreeSizeReduction, 5.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 5681048 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 597 ConstructedInterpolants, 266 QuantifiedInterpolants, 71141 SizeOfPredicates, 183 NumberOfNonLiveVariables, 1393 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 125 InterpolantComputations, 3 PerfectInterpolantSequences, 32/617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...