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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:22:24,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:22:24,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:22:24,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:22:24,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:22:24,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:22:24,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:22:24,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:22:24,829 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:22:24,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:22:24,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:22:24,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:22:24,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:22:24,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:22:24,837 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:22:24,839 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:22:24,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:22:24,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:22:24,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:22:24,845 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:22:24,846 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:22:24,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:22:24,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:22:24,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:22:24,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:22:24,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:22:24,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:22:24,853 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:22:24,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:22:24,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:22:24,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:22:24,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:22:24,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:22:24,860 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:22:24,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:22:24,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:22:24,862 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:22:24,889 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:22:24,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:22:24,892 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:22:24,892 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:22:24,892 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:22:24,892 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:22:24,892 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:22:24,893 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:22:24,893 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:22:24,894 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:22:24,894 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:22:24,894 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:22:24,894 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:22:24,894 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:22:24,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:22:24,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:22:24,895 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:22:24,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:22:24,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:22:24,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:22:24,899 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:22:24,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:22:24,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:22:24,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:22:24,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:22:24,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:22:24,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:24,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:22:24,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:22:24,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:22:24,901 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:22:24,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:22:24,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:22:24,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:22:24,902 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:22:24,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:22:24,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:22:24,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:22:24,966 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:22:24,967 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:22:24,967 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-02-28 10:22:24,968 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-02-28 10:22:25,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:22:25,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:22:25,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:25,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:22:25,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:22:25,029 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,046 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:25,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:22:25,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:22:25,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:22:25,091 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,091 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,092 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,093 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,097 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,104 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,105 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 28.02 10:22:24" (1/1) ... [2019-02-28 10:22:25,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:22:25,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:22:25,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:22:25,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:22:25,114 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 28.02 10:22:24" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:22:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:22:25,391 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:22:25,391 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-28 10:22:25,393 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:22:25 BoogieIcfgContainer [2019-02-28 10:22:25,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:22:25,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:22:25,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:22:25,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:22:25,399 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 28.02 10:22:24" (1/2) ... [2019-02-28 10:22:25,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9db658 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:22:25, skipping insertion in model container [2019-02-28 10:22:25,400 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 28.02 10:22:25" (2/2) ... [2019-02-28 10:22:25,403 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-02-28 10:22:25,413 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:22:25,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-28 10:22:25,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-28 10:22:25,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:22:25,480 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:22:25,480 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:22:25,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:22:25,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:22:25,480 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:22:25,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:22:25,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:22:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-28 10:22:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:22:25,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:25,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:22:25,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:25,524 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-28 10:22:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:25,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:25,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:25,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:25,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:25,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:25,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:25,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:25,777 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-28 10:22:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:25,937 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-28 10:22:25,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:25,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:22:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:25,954 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:22:25,954 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:22:25,957 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-02-28 10:22:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:22:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-28 10:22:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:22:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-28 10:22:25,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-28 10:22:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:25,996 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-28 10:22:25,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-28 10:22:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:25,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:25,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:25,997 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-28 10:22:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:26,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:26,284 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:22:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:26,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:26,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:26,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:26,307 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-28 10:22:26,346 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:26,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:26,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:26,432 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:26,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:26,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:26,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:26,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:26,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:26,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:26,526 INFO L442 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-02-28 10:22:26,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,536 INFO L442 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-02-28 10:22:26,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,552 INFO L442 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-02-28 10:22:26,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:26,638 INFO L442 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-02-28 10:22:26,639 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:26,698 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:26,761 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:26,855 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:27,005 INFO L315 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-02-28 10:22:27,006 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:27,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,113 INFO L442 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-02-28 10:22:27,114 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:27,151 INFO L315 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-02-28 10:22:27,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:27,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:27,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:27,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:27,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:27,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:27,330 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-28 10:22:27,472 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-02-28 10:22:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:27,649 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-28 10:22:27,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:27,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:27,650 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:22:27,651 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:22:27,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:22:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-28 10:22:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:22:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-28 10:22:27,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-28 10:22:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-28 10:22:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-28 10:22:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:27,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:27,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:27,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-28 10:22:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:27,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:27,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:27,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:27,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:27,700 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-28 10:22:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:27,797 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-28 10:22:27,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:27,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:22:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:27,799 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:22:27,800 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:22:27,800 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-02-28 10:22:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:22:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-28 10:22:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:22:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-28 10:22:27,805 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-28 10:22:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:27,805 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-28 10:22:27,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-28 10:22:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:27,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:27,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:27,806 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-28 10:22:27,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:27,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:27,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:27,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:27,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:27,883 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-28 10:22:27,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:27,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:27,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:27,896 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:27,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:27,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:27,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:27,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:27,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:27,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:27,921 INFO L442 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-02-28 10:22:27,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,929 INFO L442 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-02-28 10:22:27,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,941 INFO L442 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-02-28 10:22:27,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:27,965 INFO L442 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-02-28 10:22:27,966 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:27,977 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,013 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,125 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,312 INFO L315 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-02-28 10:22:28,312 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:28,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,363 INFO L442 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-02-28 10:22:28,364 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,389 INFO L315 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-02-28 10:22:28,390 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,410 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:28,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:22:28,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:28,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:28,465 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-28 10:22:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:28,528 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-28 10:22:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:28,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:22:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:28,530 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:22:28,531 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:22:28,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:22:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-28 10:22:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:22:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-28 10:22:28,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-28 10:22:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:28,541 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-28 10:22:28,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-28 10:22:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:28,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:28,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:28,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-28 10:22:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:28,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:28,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:28,684 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-28 10:22:28,685 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:28,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:28,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:28,692 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 3. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:28,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:28,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:28,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:28,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:28,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:28,725 INFO L442 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-02-28 10:22:28,733 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,734 INFO L442 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-02-28 10:22:28,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,751 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,755 INFO L442 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-02-28 10:22:28,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,773 INFO L442 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-02-28 10:22:28,774 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,786 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,797 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,808 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,901 INFO L315 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-02-28 10:22:28,901 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:28,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:28,948 INFO L442 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-02-28 10:22:28,949 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:28,967 INFO L315 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-02-28 10:22:28,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:29,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:29,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:29,018 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-28 10:22:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:29,244 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-28 10:22:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:29,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:29,246 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:22:29,246 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:22:29,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:22:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-28 10:22:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:22:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-28 10:22:29,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-28 10:22:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:29,253 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-28 10:22:29,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-28 10:22:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:29,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:29,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:29,254 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:29,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-28 10:22:29,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:29,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:29,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:29,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:29,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:29,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:29,333 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-28 10:22:29,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:29,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:29,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:29,344 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:29,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:29,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:29,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:29,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:29,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:29,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:29,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:29,373 INFO L442 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-02-28 10:22:29,404 INFO L442 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-02-28 10:22:29,409 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,420 INFO L442 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-02-28 10:22:29,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,469 INFO L442 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-02-28 10:22:29,470 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:29,493 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:29,503 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:29,519 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:29,533 INFO L315 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-02-28 10:22:29,533 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:29,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,577 INFO L442 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-02-28 10:22:29,579 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:29,618 INFO L315 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-02-28 10:22:29,619 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:29,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:29,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:22:29,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:29,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:29,734 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-28 10:22:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:29,785 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-28 10:22:29,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:29,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:22:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:29,786 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:22:29,786 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:22:29,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:22:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-28 10:22:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:22:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-28 10:22:29,793 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-28 10:22:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:29,794 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-28 10:22:29,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-28 10:22:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:29,794 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:29,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:29,795 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-28 10:22:29,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:29,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:29,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:29,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:29,943 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-28 10:22:29,945 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:29,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:29,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:29,952 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:29,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:29,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:29,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:29,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:29,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:29,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:29,977 INFO L442 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-02-28 10:22:29,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,982 INFO L442 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-02-28 10:22:29,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:29,996 INFO L442 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-02-28 10:22:30,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,014 INFO L442 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-02-28 10:22:30,015 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,034 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,046 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,062 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,080 INFO L315 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-02-28 10:22:30,081 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:30,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,120 INFO L442 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-02-28 10:22:30,121 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,199 INFO L315 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-02-28 10:22:30,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:30,250 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,261 INFO L442 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-02-28 10:22:30,262 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,280 INFO L315 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-02-28 10:22:30,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:30,303 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:30,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:30,354 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-28 10:22:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:30,694 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-28 10:22:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:30,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:30,696 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:22:30,696 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:22:30,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:22:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-28 10:22:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:22:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-28 10:22:30,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-28 10:22:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:30,703 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-28 10:22:30,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-28 10:22:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:30,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:30,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:30,705 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-28 10:22:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:30,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:30,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:30,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:30,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:30,808 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-28 10:22:30,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:30,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:30,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:30,816 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:30,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:30,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:30,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:30,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:30,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:30,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:30,856 INFO L442 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-02-28 10:22:30,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,881 INFO L442 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-02-28 10:22:30,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,887 INFO L442 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-02-28 10:22:30,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,896 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,905 INFO L442 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-02-28 10:22:30,906 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,922 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,935 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,945 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:30,966 INFO L315 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-02-28 10:22:30,966 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:30,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:30,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,005 INFO L442 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-02-28 10:22:31,006 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,023 INFO L315 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-02-28 10:22:31,024 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:31,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,076 INFO L442 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-02-28 10:22:31,077 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,099 INFO L315 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-02-28 10:22:31,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:31,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:31,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:31,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:31,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:31,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:31,204 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-28 10:22:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:31,649 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-02-28 10:22:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:31,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:31,651 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:22:31,651 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:22:31,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:22:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-02-28 10:22:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:22:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-02-28 10:22:31,661 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-02-28 10:22:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:31,661 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-02-28 10:22:31,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-02-28 10:22:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:31,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:31,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:31,662 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:31,663 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-28 10:22:31,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:31,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:31,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:31,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:31,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:31,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:31,754 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-28 10:22:31,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:31,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:31,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:31,764 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:31,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:31,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:31,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:31,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:31,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:31,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:31,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:31,786 INFO L442 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-02-28 10:22:31,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,817 INFO L442 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-02-28 10:22:31,828 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,829 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,831 INFO L442 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-02-28 10:22:31,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:31,930 INFO L442 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-02-28 10:22:31,931 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,940 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,947 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,957 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:31,971 INFO L315 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-02-28 10:22:31,971 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:32,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,148 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,189 INFO L289 Elim1Store]: Index analysis took 124 ms [2019-02-28 10:22:32,191 INFO L442 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-02-28 10:22:32,192 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:32,377 INFO L315 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-02-28 10:22:32,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:32,454 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,456 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,458 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,459 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:32,461 INFO L442 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-02-28 10:22:32,462 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:32,477 INFO L315 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-02-28 10:22:32,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:32,493 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:32,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:32,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:32,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:32,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:32,568 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-02-28 10:22:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:32,942 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-02-28 10:22:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:32,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:32,944 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:22:32,944 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:22:32,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:22:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-02-28 10:22:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:22:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-02-28 10:22:32,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-02-28 10:22:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:32,954 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-02-28 10:22:32,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-02-28 10:22:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:32,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:32,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:32,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-28 10:22:32,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:32,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:32,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:33,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:33,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:33,038 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-28 10:22:33,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:33,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:33,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:33,052 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:33,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:33,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:33,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:33,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:33,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:33,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:33,086 INFO L442 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-02-28 10:22:33,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,090 INFO L442 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-02-28 10:22:33,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,105 INFO L442 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-02-28 10:22:33,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,131 INFO L442 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-02-28 10:22:33,132 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,199 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,209 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,217 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,232 INFO L315 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-02-28 10:22:33,233 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:33,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,255 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,265 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,267 INFO L442 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-02-28 10:22:33,268 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,283 INFO L315 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-02-28 10:22:33,284 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:33,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:33,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:33,332 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-02-28 10:22:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:33,447 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-02-28 10:22:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:33,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:33,449 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:22:33,449 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:22:33,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:22:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-02-28 10:22:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:22:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-02-28 10:22:33,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-02-28 10:22:33,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:33,458 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-02-28 10:22:33,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-02-28 10:22:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:33,459 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:33,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:33,460 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-02-28 10:22:33,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:33,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:33,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:33,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:33,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:33,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:33,569 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-02-28 10:22:33,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:33,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:33,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:33,576 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:33,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:33,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:33,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:33,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:33,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:33,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:33,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:33,595 INFO L442 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-02-28 10:22:33,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,599 INFO L442 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-02-28 10:22:33,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,632 INFO L442 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-02-28 10:22:33,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,641 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,643 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,644 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,645 INFO L442 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-02-28 10:22:33,646 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,660 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,669 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,676 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,693 INFO L315 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-02-28 10:22:33,693 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:33,735 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,738 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,743 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,744 INFO L442 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-02-28 10:22:33,745 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,766 INFO L315 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-02-28 10:22:33,766 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:33,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,791 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,795 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:33,796 INFO L442 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-02-28 10:22:33,797 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:33,827 INFO L315 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-02-28 10:22:33,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:33,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:33,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:33,884 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-02-28 10:22:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:34,350 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-02-28 10:22:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:34,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:34,352 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:22:34,352 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:22:34,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:22:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-02-28 10:22:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:22:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-02-28 10:22:34,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-02-28 10:22:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:34,363 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-02-28 10:22:34,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-02-28 10:22:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:34,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:34,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:34,365 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:34,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-28 10:22:34,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:34,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:34,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:34,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:34,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:34,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:34,469 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:34,469 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-28 10:22:34,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:34,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:34,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:34,474 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:34,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:34,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:34,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:34,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:34,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:34,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:34,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:34,497 INFO L442 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-02-28 10:22:34,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,503 INFO L442 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-02-28 10:22:34,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,515 INFO L442 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-02-28 10:22:34,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,524 INFO L442 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-02-28 10:22:34,524 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,535 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,545 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,661 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,675 INFO L315 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-02-28 10:22:34,675 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:34,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,752 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,758 INFO L442 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-02-28 10:22:34,759 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,772 INFO L315 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-02-28 10:22:34,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:34,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,806 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:34,810 INFO L442 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-02-28 10:22:34,810 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:34,838 INFO L315 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-02-28 10:22:34,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:34,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:34,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:34,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:34,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:34,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:34,906 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-02-28 10:22:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:35,237 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-02-28 10:22:35,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:35,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:35,245 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:22:35,245 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:22:35,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:22:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-02-28 10:22:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:22:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-28 10:22:35,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-28 10:22:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:35,255 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-28 10:22:35,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-28 10:22:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:35,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:35,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:35,257 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-28 10:22:35,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:35,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:35,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:35,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:35,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:35,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:35,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:35,331 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:35,332 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-28 10:22:35,333 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:35,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:35,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:35,337 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 3. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:35,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:35,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:35,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:35,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:35,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:35,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:35,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:35,356 INFO L442 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-02-28 10:22:35,370 INFO L442 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-02-28 10:22:35,376 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,405 INFO L442 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-02-28 10:22:35,413 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,415 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,431 INFO L442 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-02-28 10:22:35,432 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,441 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,449 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,457 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,480 INFO L315 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-02-28 10:22:35,481 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:35,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,515 INFO L442 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-02-28 10:22:35,516 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,527 INFO L315 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-02-28 10:22:35,527 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-28 10:22:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:35,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:35,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:35,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:35,575 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-02-28 10:22:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:35,760 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-02-28 10:22:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:35,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:22:35,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:35,762 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:22:35,762 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:22:35,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:22:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:22:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-02-28 10:22:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:22:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-02-28 10:22:35,772 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-02-28 10:22:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:35,772 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-02-28 10:22:35,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-02-28 10:22:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:35,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:35,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:35,773 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-28 10:22:35,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:35,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:35,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:35,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:35,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:35,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:35,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:35,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:35,882 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-28 10:22:35,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:35,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:35,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:35,891 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:35,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:35,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:35,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:35,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:35,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:35,918 INFO L442 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-02-28 10:22:35,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,921 INFO L442 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-02-28 10:22:35,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,931 INFO L442 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-02-28 10:22:35,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:35,954 INFO L442 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-02-28 10:22:35,954 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,969 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,982 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:35,992 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,014 INFO L315 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-02-28 10:22:36,015 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:36,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,054 INFO L442 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-02-28 10:22:36,055 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,076 INFO L315 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-02-28 10:22:36,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:36,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,118 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,119 INFO L442 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-02-28 10:22:36,119 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,138 INFO L315 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-02-28 10:22:36,138 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:36,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:36,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:36,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:36,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:36,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:36,228 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-02-28 10:22:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:36,522 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-02-28 10:22:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:36,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:36,524 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:22:36,524 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:22:36,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:22:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-02-28 10:22:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:22:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-28 10:22:36,536 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-28 10:22:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:36,536 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-28 10:22:36,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-28 10:22:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:36,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:36,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:36,538 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-02-28 10:22:36,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:36,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:36,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:36,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:36,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:36,769 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-28 10:22:36,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:36,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:36,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:36,775 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:36,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:36,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:36,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:36,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:36,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:36,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:36,799 INFO L442 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-02-28 10:22:36,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,803 INFO L442 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-02-28 10:22:36,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,813 INFO L442 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-02-28 10:22:36,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,822 INFO L442 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-02-28 10:22:36,823 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,828 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,837 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,845 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,865 INFO L315 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-02-28 10:22:36,865 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:36,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,894 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,895 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,896 INFO L442 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-02-28 10:22:36,897 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,914 INFO L315 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-02-28 10:22:36,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:36,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,942 INFO L442 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-02-28 10:22:36,943 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:36,960 INFO L315 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-02-28 10:22:36,960 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:36,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:36,993 INFO L442 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-02-28 10:22:36,993 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:37,007 INFO L315 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-02-28 10:22:37,007 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:37,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:37,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:37,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:37,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:37,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:37,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:37,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:37,129 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-02-28 10:22:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:37,704 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-02-28 10:22:37,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:37,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:37,706 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:22:37,707 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:22:37,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:22:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-02-28 10:22:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:22:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-28 10:22:37,718 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-28 10:22:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:37,719 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-28 10:22:37,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-28 10:22:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:37,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:37,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:37,720 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:37,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-28 10:22:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:37,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:37,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:37,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:37,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:37,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:37,882 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-28 10:22:37,883 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:37,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:37,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:37,888 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:37,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:37,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:37,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:37,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:37,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:37,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:37,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:37,913 INFO L442 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-02-28 10:22:37,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,921 INFO L442 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-02-28 10:22:37,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,934 INFO L442 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-02-28 10:22:37,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:37,951 INFO L442 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-02-28 10:22:37,951 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:37,971 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:37,983 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:37,990 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:38,005 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:38,005 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:38,251 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:22:38,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,403 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,425 INFO L289 Elim1Store]: Index analysis took 152 ms [2019-02-28 10:22:38,426 INFO L442 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-02-28 10:22:38,427 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:38,598 INFO L315 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-02-28 10:22:38,599 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:38,825 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-28 10:22:38,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,919 INFO L442 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-02-28 10:22:38,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:38,933 INFO L315 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-02-28 10:22:38,933 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:38,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:38,966 INFO L442 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-02-28 10:22:38,967 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:38,993 INFO L315 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-02-28 10:22:38,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:22:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:39,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:39,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:39,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:39,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:39,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:39,069 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-28 10:22:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:39,576 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-02-28 10:22:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:39,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:39,578 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:22:39,578 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:22:39,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:22:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:22:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-02-28 10:22:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:22:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-02-28 10:22:39,590 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-02-28 10:22:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:39,591 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-02-28 10:22:39,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-02-28 10:22:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:39,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:39,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:39,592 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-28 10:22:39,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:39,786 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:22:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:39,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:39,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:39,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:39,826 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-28 10:22:39,828 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:39,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:39,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:39,832 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:39,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:39,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:39,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:39,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:39,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:39,860 INFO L442 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-02-28 10:22:39,877 INFO L442 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-02-28 10:22:39,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,888 INFO L442 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-02-28 10:22:39,897 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,898 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,914 INFO L442 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-02-28 10:22:39,915 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:39,932 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:39,940 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:39,947 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:39,959 INFO L315 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-02-28 10:22:39,960 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:39,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:39,987 INFO L442 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-02-28 10:22:39,987 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:39,998 INFO L315 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-02-28 10:22:39,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:40,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,019 INFO L442 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-02-28 10:22:40,019 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,030 INFO L315 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-02-28 10:22:40,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:22:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:40,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:40,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:40,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:40,088 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-02-28 10:22:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:40,306 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-02-28 10:22:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:40,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:40,308 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:22:40,308 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:22:40,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:22:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-02-28 10:22:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:22:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-28 10:22:40,318 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-28 10:22:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:40,318 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-28 10:22:40,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-28 10:22:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:40,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:40,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:40,319 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-02-28 10:22:40,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:40,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:40,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:40,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:40,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:40,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:40,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:40,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:40,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:40,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:22:40,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:40,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:40,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:40,496 INFO L442 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-02-28 10:22:40,498 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,498 INFO L442 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-02-28 10:22:40,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,504 INFO L442 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-02-28 10:22:40,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,514 INFO L442 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-02-28 10:22:40,515 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,535 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,542 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,551 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,566 INFO L315 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-02-28 10:22:40,566 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:40,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,599 INFO L442 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-02-28 10:22:40,600 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,614 INFO L315 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-02-28 10:22:40,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:40,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,641 INFO L442 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-02-28 10:22:40,641 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,655 INFO L315 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-02-28 10:22:40,655 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:40,690 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,692 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:40,696 INFO L442 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-02-28 10:22:40,697 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:40,712 INFO L315 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-02-28 10:22:40,712 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:40,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:40,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:40,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:40,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:40,785 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-02-28 10:22:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:41,228 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-02-28 10:22:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:41,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:41,230 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:22:41,230 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:22:41,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:22:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-02-28 10:22:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:22:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-28 10:22:41,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-02-28 10:22:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:41,242 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-28 10:22:41,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-28 10:22:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:41,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:41,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:41,243 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-28 10:22:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:41,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:41,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:41,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:22:41,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:41,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:22:41,307 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-02-28 10:22:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:41,520 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-02-28 10:22:41,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:41,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:22:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:41,522 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:22:41,522 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:22:41,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:22:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:22:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-02-28 10:22:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:22:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-02-28 10:22:41,532 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-02-28 10:22:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:41,532 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-02-28 10:22:41,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-02-28 10:22:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:41,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:41,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:41,533 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-28 10:22:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:41,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:41,699 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:22:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:41,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:41,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:41,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:41,728 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-28 10:22:41,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:41,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:41,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:41,734 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:41,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:41,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:41,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:41,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:41,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:41,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:41,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:41,753 INFO L442 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-02-28 10:22:41,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,764 INFO L442 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-02-28 10:22:41,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,770 INFO L442 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-02-28 10:22:41,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,789 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,789 INFO L442 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-02-28 10:22:41,790 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,804 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,812 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,821 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,837 INFO L315 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-02-28 10:22:41,838 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:41,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,890 INFO L442 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-02-28 10:22:41,891 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,906 INFO L315 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-02-28 10:22:41,907 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:41,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:41,940 INFO L442 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-02-28 10:22:41,941 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:41,958 INFO L315 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-02-28 10:22:41,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:41,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:22:42,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:42,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:42,011 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-02-28 10:22:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:42,295 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-02-28 10:22:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:42,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:42,296 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:22:42,296 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:22:42,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:22:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-02-28 10:22:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:22:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-02-28 10:22:42,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-02-28 10:22:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:42,311 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-02-28 10:22:42,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-02-28 10:22:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:42,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:42,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:42,312 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-28 10:22:42,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:42,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:42,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:42,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:42,423 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-28 10:22:42,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:42,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:42,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:42,428 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:42,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:42,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:42,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:42,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:42,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:42,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:42,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:42,449 INFO L442 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-02-28 10:22:42,451 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,452 INFO L442 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-02-28 10:22:42,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,493 INFO L442 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-02-28 10:22:42,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,498 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,501 INFO L442 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-02-28 10:22:42,502 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,510 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,519 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,544 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,557 INFO L315 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-02-28 10:22:42,558 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:42,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,584 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,585 INFO L442 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-02-28 10:22:42,585 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,599 INFO L315 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-02-28 10:22:42,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:42,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:42,634 INFO L442 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-02-28 10:22:42,635 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:42,648 INFO L315 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-02-28 10:22:42,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:42,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:43,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:43,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:43,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:43,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:43,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:43,160 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-02-28 10:22:43,748 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-02-28 10:22:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:44,065 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-02-28 10:22:44,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:44,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:44,067 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:22:44,067 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:22:44,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:22:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-02-28 10:22:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:22:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-02-28 10:22:44,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-02-28 10:22:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:44,081 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-02-28 10:22:44,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-02-28 10:22:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:44,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:44,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:44,082 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-28 10:22:44,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:44,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:44,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:44,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:44,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:44,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:44,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:44,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:44,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:44,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:22:44,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:44,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:44,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:44,183 INFO L442 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-02-28 10:22:44,186 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,186 INFO L442 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-02-28 10:22:44,188 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,189 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,190 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,191 INFO L442 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-02-28 10:22:44,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,199 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,201 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,202 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,203 INFO L442 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-02-28 10:22:44,203 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,212 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,219 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,228 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,240 INFO L315 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-02-28 10:22:44,241 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:44,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,278 INFO L442 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-02-28 10:22:44,279 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,322 INFO L315 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-02-28 10:22:44,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:44,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,344 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,346 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,348 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:44,349 INFO L442 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-02-28 10:22:44,349 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:44,362 INFO L315 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-02-28 10:22:44,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:44,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:44,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:44,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:44,418 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-02-28 10:22:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:44,932 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-02-28 10:22:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:44,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:44,934 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:22:44,934 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:22:44,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:22:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-02-28 10:22:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:22:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-02-28 10:22:44,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-02-28 10:22:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:44,950 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-02-28 10:22:44,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-02-28 10:22:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:44,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:44,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:44,951 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-02-28 10:22:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:44,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:44,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:45,082 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:45,082 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-02-28 10:22:45,083 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:45,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:45,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:45,086 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:45,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:45,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:45,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:45,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:45,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:45,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:45,113 INFO L442 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-02-28 10:22:45,130 INFO L442 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-02-28 10:22:45,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,143 INFO L442 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-02-28 10:22:45,145 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,146 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,158 INFO L442 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-02-28 10:22:45,158 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,180 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,190 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,196 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,209 INFO L315 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-02-28 10:22:45,210 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:45,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,238 INFO L442 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-02-28 10:22:45,238 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,249 INFO L315 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-02-28 10:22:45,249 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:45,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:45,288 INFO L442 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-02-28 10:22:45,288 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:45,297 INFO L315 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-02-28 10:22:45,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-02-28 10:22:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:45,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:45,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:45,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:45,520 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-02-28 10:22:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:45,834 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-02-28 10:22:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:45,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:45,836 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:22:45,836 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:22:45,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:45,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:22:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-02-28 10:22:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:22:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-02-28 10:22:45,852 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-02-28 10:22:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:45,852 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-02-28 10:22:45,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-02-28 10:22:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:45,853 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:45,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:45,853 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:45,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-02-28 10:22:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:45,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:45,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:45,892 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-02-28 10:22:45,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:45,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:45,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:45,897 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:45,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:45,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:45,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:45,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:45,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:22:45,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:45,918 INFO L442 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-02-28 10:22:45,932 INFO L442 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-02-28 10:22:45,973 INFO L442 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-02-28 10:22:45,978 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,050 INFO L442 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-02-28 10:22:46,050 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,058 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,066 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,073 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,083 INFO L315 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-02-28 10:22:46,084 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-02-28 10:22:46,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,101 INFO L442 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-02-28 10:22:46,102 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,108 INFO L315 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-02-28 10:22:46,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-02-28 10:22:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:46,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:22:46,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:46,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:46,143 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-02-28 10:22:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:46,393 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-02-28 10:22:46,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:46,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:22:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:46,394 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:22:46,394 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:22:46,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:22:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-02-28 10:22:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:22:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-02-28 10:22:46,412 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-02-28 10:22:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:46,412 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-02-28 10:22:46,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-02-28 10:22:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:46,413 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:46,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:46,413 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-02-28 10:22:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:46,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:46,739 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-02-28 10:22:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:46,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:46,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:46,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:46,772 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-28 10:22:46,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:46,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:46,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:46,778 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:46,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:46,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:46,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:46,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:46,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:46,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:46,798 INFO L442 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-02-28 10:22:46,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,800 INFO L442 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-02-28 10:22:46,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,805 INFO L442 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-02-28 10:22:46,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,818 INFO L442 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-02-28 10:22:46,819 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,825 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,833 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,841 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,856 INFO L315 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-02-28 10:22:46,856 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:46,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,881 INFO L442 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-02-28 10:22:46,881 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:46,898 INFO L315 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-02-28 10:22:46,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:46,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:46,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,020 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,061 INFO L289 Elim1Store]: Index analysis took 129 ms [2019-02-28 10:22:47,062 INFO L442 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-02-28 10:22:47,063 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,257 INFO L315 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-02-28 10:22:47,257 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:47,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,341 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:47,345 INFO L442 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-02-28 10:22:47,345 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:47,359 INFO L315 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-02-28 10:22:47,360 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:47,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:47,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:22:47,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:47,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:47,449 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-02-28 10:22:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:47,870 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-02-28 10:22:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:22:47,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:22:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:47,872 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:22:47,873 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:22:47,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:22:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:22:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-02-28 10:22:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:22:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-02-28 10:22:47,893 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-02-28 10:22:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:47,893 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-02-28 10:22:47,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-02-28 10:22:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:47,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:47,894 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:22:47,894 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-02-28 10:22:47,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:47,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:47,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:48,153 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 10:22:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:48,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:48,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:48,158 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-02-28 10:22:48,158 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:48,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:48,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:48,163 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:48,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:48,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:48,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:48,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:48,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:48,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:22:48,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:48,213 INFO L442 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-02-28 10:22:48,226 INFO L442 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-02-28 10:22:48,274 INFO L442 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-02-28 10:22:48,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,549 INFO L442 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-02-28 10:22:48,550 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,665 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,707 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,714 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,725 INFO L315 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-02-28 10:22:48,725 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-28 10:22:48,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,755 INFO L442 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-02-28 10:22:48,756 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,761 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-02-28 10:22:48,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:48,787 INFO L442 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-02-28 10:22:48,788 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:48,793 INFO L315 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-02-28 10:22:48,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-28 10:22:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,807 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:48,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:22:48,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:48,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:22:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:22:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:48,885 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-02-28 10:22:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:49,048 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-02-28 10:22:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:49,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 10:22:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:49,050 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:22:49,050 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:22:49,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:22:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-02-28 10:22:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:22:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-28 10:22:49,068 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-28 10:22:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:49,068 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-28 10:22:49,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:22:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-28 10:22:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:49,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:49,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:49,069 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-28 10:22:49,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:49,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:49,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:49,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:49,166 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-28 10:22:49,167 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:49,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:49,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:49,171 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:49,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:49,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:49,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:49,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:49,192 INFO L442 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-02-28 10:22:49,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,195 INFO L442 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-02-28 10:22:49,200 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,203 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,206 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,207 INFO L442 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-02-28 10:22:49,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,214 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,218 INFO L442 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-02-28 10:22:49,219 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,228 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,238 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,246 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,262 INFO L315 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-02-28 10:22:49,263 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:49,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,368 INFO L442 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-02-28 10:22:49,369 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,384 INFO L315 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-02-28 10:22:49,384 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:49,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,444 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,446 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,448 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,449 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,450 INFO L442 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-02-28 10:22:49,451 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,465 INFO L315 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-02-28 10:22:49,465 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:49,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:49,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:49,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:49,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:49,534 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-02-28 10:22:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:49,771 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-02-28 10:22:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:49,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:22:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:49,773 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:22:49,773 INFO L226 Difference]: Without dead ends: 82 [2019-02-28 10:22:49,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-28 10:22:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-02-28 10:22:49,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:22:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-28 10:22:49,791 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-28 10:22:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:49,792 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-28 10:22:49,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-28 10:22:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:49,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:49,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:49,792 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:49,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-28 10:22:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:49,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:49,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:49,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:49,905 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-28 10:22:49,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:49,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:49,909 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:49,909 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:49,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:49,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:49,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:49,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:49,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:49,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:49,935 INFO L442 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-02-28 10:22:49,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,941 INFO L442 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-02-28 10:22:49,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,949 INFO L442 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-02-28 10:22:49,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:49,967 INFO L442 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-02-28 10:22:49,968 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,977 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,987 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,995 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,008 INFO L315 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-02-28 10:22:50,008 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:50,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,033 INFO L442 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-02-28 10:22:50,034 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,049 INFO L315 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-02-28 10:22:50,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:50,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,076 INFO L442 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-02-28 10:22:50,076 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,092 INFO L315 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-02-28 10:22:50,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:50,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,115 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,117 INFO L442 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-02-28 10:22:50,117 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,131 INFO L315 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-02-28 10:22:50,132 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:50,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:22:50,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:50,281 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-28 10:22:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:50,630 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-02-28 10:22:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:22:50,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:22:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:50,632 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:22:50,632 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:22:50,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:22:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-02-28 10:22:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:22:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-02-28 10:22:50,650 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-02-28 10:22:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:50,650 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-02-28 10:22:50,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-02-28 10:22:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:50,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:50,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:50,651 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-28 10:22:50,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:50,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:50,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:50,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:50,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:50,830 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-28 10:22:50,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:50,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:50,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:50,835 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:50,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:50,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:50,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:50,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:50,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:50,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:50,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:50,859 INFO L442 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-02-28 10:22:50,864 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,864 INFO L442 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-02-28 10:22:50,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,869 INFO L442 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-02-28 10:22:50,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,881 INFO L442 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-02-28 10:22:50,881 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,931 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,951 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,957 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,972 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:50,972 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:50,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:50,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,002 INFO L442 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-02-28 10:22:51,003 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,023 INFO L315 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-02-28 10:22:51,023 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:51,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,049 INFO L442 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-02-28 10:22:51,050 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,065 INFO L315 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-02-28 10:22:51,066 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:51,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,093 INFO L442 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-02-28 10:22:51,093 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,109 INFO L315 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-02-28 10:22:51,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:51,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:51,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:51,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:51,194 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-02-28 10:22:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:51,696 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-02-28 10:22:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:51,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:22:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:51,698 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:22:51,698 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:22:51,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:22:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:22:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-02-28 10:22:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:22:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-02-28 10:22:51,739 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-02-28 10:22:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:51,739 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-02-28 10:22:51,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-02-28 10:22:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:51,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:51,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:51,740 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-02-28 10:22:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:51,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:51,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:51,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:51,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:51,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:51,882 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-02-28 10:22:51,884 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:51,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:51,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:51,888 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:51,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:51,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:51,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:51,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:51,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:51,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:51,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:51,920 INFO L442 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-02-28 10:22:51,932 INFO L442 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-02-28 10:22:51,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,946 INFO L442 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-02-28 10:22:51,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:51,964 INFO L442 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-02-28 10:22:51,965 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,971 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,980 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:51,988 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,000 INFO L315 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-02-28 10:22:52,001 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:52,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,033 INFO L442 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-02-28 10:22:52,033 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,044 INFO L315 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-02-28 10:22:52,044 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:52,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,088 INFO L442 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-02-28 10:22:52,088 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,098 INFO L315 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-02-28 10:22:52,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-02-28 10:22:52,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,121 INFO L442 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-02-28 10:22:52,121 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,131 INFO L315 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-02-28 10:22:52,131 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-28 10:22:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:52,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:22:52,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:52,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:22:52,199 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-02-28 10:22:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:52,653 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-02-28 10:22:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:22:52,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:22:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:52,655 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:22:52,655 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:22:52,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:22:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-02-28 10:22:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:22:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-02-28 10:22:52,683 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-02-28 10:22:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:52,683 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-02-28 10:22:52,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-02-28 10:22:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:52,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:52,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:52,684 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-02-28 10:22:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:52,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:52,882 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-28 10:22:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:52,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:52,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:52,942 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-28 10:22:52,943 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:52,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:52,946 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:52,946 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:22:52,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:52,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:52,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:52,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:52,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:52,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:52,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:52,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:52,966 INFO L442 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-02-28 10:22:52,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,970 INFO L442 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-02-28 10:22:52,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,974 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,975 INFO L442 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-02-28 10:22:52,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:52,987 INFO L442 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-02-28 10:22:52,988 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:52,996 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,005 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,013 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,027 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,028 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:53,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,054 INFO L442 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-02-28 10:22:53,054 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,067 INFO L315 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-02-28 10:22:53,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:53,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,093 INFO L442 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-02-28 10:22:53,094 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,109 INFO L315 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-02-28 10:22:53,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:53,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,227 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,230 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,231 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,235 INFO L442 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-02-28 10:22:53,236 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,260 INFO L315 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-02-28 10:22:53,261 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:22:53,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:53,288 INFO L442 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-02-28 10:22:53,289 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:53,308 INFO L315 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-02-28 10:22:53,308 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:22:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:53,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:53,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:22:53,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:53,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:22:53,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:22:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:53,386 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-02-28 10:22:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:55,068 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-02-28 10:22:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:22:55,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:22:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:55,069 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:22:55,069 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:22:55,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:22:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:22:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-02-28 10:22:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:22:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-02-28 10:22:55,092 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-02-28 10:22:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:55,092 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-02-28 10:22:55,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:22:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-02-28 10:22:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:55,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:55,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:55,093 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:55,093 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-02-28 10:22:55,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:55,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:55,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:55,781 WARN L181 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-02-28 10:22:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:55,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:55,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:55,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:55,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:55,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:55,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:55,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:55,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:22:55,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:55,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:55,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:55,895 INFO L442 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-02-28 10:22:55,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,900 INFO L442 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-02-28 10:22:55,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,907 INFO L442 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-02-28 10:22:55,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:55,935 INFO L442 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-02-28 10:22:55,936 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,954 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,962 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,970 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,983 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:55,983 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:56,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,010 INFO L442 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-02-28 10:22:56,011 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:56,025 INFO L315 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-02-28 10:22:56,026 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:56,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,054 INFO L442 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-02-28 10:22:56,055 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:56,070 INFO L315 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-02-28 10:22:56,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:56,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,101 INFO L442 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-02-28 10:22:56,101 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:56,116 INFO L315 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-02-28 10:22:56,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:22:56,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:56,144 INFO L442 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-02-28 10:22:56,144 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:56,159 INFO L315 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-02-28 10:22:56,159 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:22:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:56,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:22:56,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:56,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:22:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:22:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:22:56,250 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-02-28 10:22:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:56,930 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-02-28 10:22:56,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:22:56,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:22:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:56,933 INFO L225 Difference]: With dead ends: 146 [2019-02-28 10:22:56,933 INFO L226 Difference]: Without dead ends: 145 [2019-02-28 10:22:56,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:22:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-28 10:22:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-02-28 10:22:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:22:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-02-28 10:22:56,963 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-02-28 10:22:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:56,964 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-02-28 10:22:56,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:22:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-02-28 10:22:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:56,964 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:56,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:56,965 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-28 10:22:56,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:56,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:56,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:56,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:56,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:57,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:57,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:57,125 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-28 10:22:57,126 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:57,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:57,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:57,130 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:57,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:57,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:57,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:57,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:57,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:22:57,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:57,152 INFO L442 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-02-28 10:22:57,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,158 INFO L442 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-02-28 10:22:57,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,167 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,170 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,170 INFO L442 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-02-28 10:22:57,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,179 INFO L442 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-02-28 10:22:57,179 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,188 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,196 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,205 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,218 INFO L315 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-02-28 10:22:57,218 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:57,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,244 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,245 INFO L442 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-02-28 10:22:57,245 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,260 INFO L315 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-02-28 10:22:57,261 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:57,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,287 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:57,289 INFO L442 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-02-28 10:22:57,289 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:57,304 INFO L315 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-02-28 10:22:57,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:57,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:57,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:22:57,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:57,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:22:57,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:22:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:22:57,369 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-02-28 10:22:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:57,776 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-02-28 10:22:57,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:57,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 10:22:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:57,779 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:22:57,779 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:22:57,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:22:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:22:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-02-28 10:22:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:22:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-02-28 10:22:57,803 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-02-28 10:22:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:57,803 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-02-28 10:22:57,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:22:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-02-28 10:22:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:57,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:57,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:57,805 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-28 10:22:57,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:57,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:57,959 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:22:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:58,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:58,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:58,004 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-28 10:22:58,007 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:58,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:58,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:58,010 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:22:58,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:58,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:58,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:58,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:58,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:58,027 INFO L442 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-02-28 10:22:58,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,034 INFO L442 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-02-28 10:22:58,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,042 INFO L442 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-02-28 10:22:58,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,051 INFO L442 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-02-28 10:22:58,051 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,060 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,068 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,077 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,089 INFO L315 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-02-28 10:22:58,090 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:58,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,136 INFO L442 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-02-28 10:22:58,137 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,171 INFO L315 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-02-28 10:22:58,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:58,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,194 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,195 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,196 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,197 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,198 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,199 INFO L442 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-02-28 10:22:58,199 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,214 INFO L315 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-02-28 10:22:58,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-02-28 10:22:58,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,242 INFO L442 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-02-28 10:22:58,242 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,257 INFO L315 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-02-28 10:22:58,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:22:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:22:58,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:58,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:22:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:22:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:58,322 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-02-28 10:22:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:58,764 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-02-28 10:22:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:22:58,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:22:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:58,767 INFO L225 Difference]: With dead ends: 153 [2019-02-28 10:22:58,767 INFO L226 Difference]: Without dead ends: 152 [2019-02-28 10:22:58,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:22:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-28 10:22:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-02-28 10:22:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-28 10:22:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-02-28 10:22:58,797 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-02-28 10:22:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:58,797 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-02-28 10:22:58,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:22:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-02-28 10:22:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:58,798 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:58,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:58,798 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-28 10:22:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:58,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:58,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:58,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:22:58,894 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-28 10:22:58,897 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:58,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:58,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:58,900 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:58,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:58,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:58,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:58,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:58,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:22:58,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:58,921 INFO L442 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-02-28 10:22:58,935 INFO L442 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-02-28 10:22:58,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,952 INFO L442 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-02-28 10:22:58,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:58,964 INFO L442 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-02-28 10:22:58,965 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,972 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,979 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,987 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:58,998 INFO L315 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-02-28 10:22:58,998 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-28 10:22:59,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,028 INFO L442 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-02-28 10:22:59,028 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,039 INFO L315 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-02-28 10:22:59,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:22:59,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,104 INFO L442 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-02-28 10:22:59,105 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,113 INFO L315 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-02-28 10:22:59,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-02-28 10:22:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:59,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:59,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:59,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:59,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:59,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:59,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:59,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:59,174 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-02-28 10:22:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:59,417 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-02-28 10:22:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:22:59,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:22:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:59,419 INFO L225 Difference]: With dead ends: 143 [2019-02-28 10:22:59,419 INFO L226 Difference]: Without dead ends: 138 [2019-02-28 10:22:59,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:22:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-28 10:22:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-02-28 10:22:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-28 10:22:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-02-28 10:22:59,452 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-02-28 10:22:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:59,452 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-02-28 10:22:59,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-02-28 10:22:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:22:59,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:59,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:22:59,454 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-28 10:22:59,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:59,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:59,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:59,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:22:59,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:59,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:59,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:59,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:59,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:59,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:22:59,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:59,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:59,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:22:59,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:59,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:59,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:59,605 INFO L442 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-02-28 10:22:59,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,607 INFO L442 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-02-28 10:22:59,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,612 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,614 INFO L442 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-02-28 10:22:59,617 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,623 INFO L442 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-02-28 10:22:59,624 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,632 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,640 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,649 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,662 INFO L315 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-02-28 10:22:59,662 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:22:59,724 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,793 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:59,835 INFO L289 Elim1Store]: Index analysis took 133 ms [2019-02-28 10:22:59,836 INFO L442 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-02-28 10:22:59,837 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:59,987 INFO L315 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-02-28 10:22:59,988 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:00,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,042 INFO L442 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-02-28 10:23:00,042 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,058 INFO L315 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-02-28 10:23:00,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:00,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,094 INFO L442 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-02-28 10:23:00,094 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,109 INFO L315 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-02-28 10:23:00,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:00,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:00,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:00,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:00,202 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-02-28 10:23:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:00,630 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-02-28 10:23:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:00,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:23:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:00,633 INFO L225 Difference]: With dead ends: 196 [2019-02-28 10:23:00,634 INFO L226 Difference]: Without dead ends: 195 [2019-02-28 10:23:00,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-28 10:23:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-02-28 10:23:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:23:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-02-28 10:23:00,676 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-02-28 10:23:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:00,676 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-02-28 10:23:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-02-28 10:23:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:00,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:00,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:00,677 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-02-28 10:23:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:00,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:00,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:00,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:00,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:00,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:00,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:00,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:00,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:00,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:23:00,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:23:00,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:23:00,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:00,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:00,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:00,869 INFO L442 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-02-28 10:23:00,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,874 INFO L442 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-02-28 10:23:00,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,883 INFO L442 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-02-28 10:23:00,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,895 INFO L442 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-02-28 10:23:00,896 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,936 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,944 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,952 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,968 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:00,968 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:00,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:00,999 INFO L442 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-02-28 10:23:01,000 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,013 INFO L315 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-02-28 10:23:01,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:01,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,081 INFO L442 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-02-28 10:23:01,081 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,109 INFO L315 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-02-28 10:23:01,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:01,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,133 INFO L442 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-02-28 10:23:01,134 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,148 INFO L315 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-02-28 10:23:01,149 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:01,170 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:01,175 INFO L442 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-02-28 10:23:01,175 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:01,189 INFO L315 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-02-28 10:23:01,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:01,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:01,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:23:01,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:01,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:01,279 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-02-28 10:23:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:01,873 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-02-28 10:23:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:01,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:23:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:01,876 INFO L225 Difference]: With dead ends: 205 [2019-02-28 10:23:01,877 INFO L226 Difference]: Without dead ends: 197 [2019-02-28 10:23:01,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:23:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-28 10:23:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-02-28 10:23:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:23:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-28 10:23:01,912 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-28 10:23:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:01,913 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-28 10:23:01,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-28 10:23:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:01,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:01,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:01,914 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-28 10:23:01,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:01,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:01,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:01,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:02,104 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-02-28 10:23:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:02,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:02,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:02,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:02,202 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-28 10:23:02,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:02,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:02,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:02,205 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:02,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:02,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:02,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:02,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:02,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:23:02,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:02,222 INFO L442 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-02-28 10:23:02,241 INFO L442 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-02-28 10:23:02,257 INFO L442 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-02-28 10:23:02,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,276 INFO L442 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-02-28 10:23:02,276 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,284 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,292 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,301 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,309 INFO L315 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-02-28 10:23:02,309 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-28 10:23:02,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,332 INFO L442 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-02-28 10:23:02,332 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,337 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,338 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-02-28 10:23:02,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:02,351 INFO L442 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-02-28 10:23:02,351 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:02,357 INFO L315 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-02-28 10:23:02,357 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-02-28 10:23:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:02,370 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:02,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:02,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:02,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:02,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:02,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:02,411 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-28 10:23:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:02,598 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-02-28 10:23:02,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:02,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:02,603 INFO L225 Difference]: With dead ends: 165 [2019-02-28 10:23:02,603 INFO L226 Difference]: Without dead ends: 164 [2019-02-28 10:23:02,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-28 10:23:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-02-28 10:23:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:23:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-02-28 10:23:02,643 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-02-28 10:23:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:02,643 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-02-28 10:23:02,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-02-28 10:23:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:23:02,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:02,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:23:02,644 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-02-28 10:23:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:02,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:02,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:02,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:02,895 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-02-28 10:23:03,223 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-02-28 10:23:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:03,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:03,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:03,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:23:03,377 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-02-28 10:23:03,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:03,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:03,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:03,380 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:03,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:03,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:03,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:03,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:03,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:03,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:23:03,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:03,401 INFO L442 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-02-28 10:23:03,420 INFO L442 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-02-28 10:23:03,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,444 INFO L442 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-02-28 10:23:03,447 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,450 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,451 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,460 INFO L442 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-02-28 10:23:03,461 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,468 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,476 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,485 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,498 INFO L315 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-02-28 10:23:03,498 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-02-28 10:23:03,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,527 INFO L442 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-02-28 10:23:03,527 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,535 INFO L315 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-02-28 10:23:03,535 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-02-28 10:23:03,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:03,556 INFO L442 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-02-28 10:23:03,557 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:03,568 INFO L315 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-02-28 10:23:03,568 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:03,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:03,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:03,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:03,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:03,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:03,628 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-02-28 10:23:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:03,876 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-02-28 10:23:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:03,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:23:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:03,878 INFO L225 Difference]: With dead ends: 174 [2019-02-28 10:23:03,878 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:23:03,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:23:03,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-02-28 10:23:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-28 10:23:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-02-28 10:23:03,926 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-02-28 10:23:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:03,926 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-02-28 10:23:03,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-02-28 10:23:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:03,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:03,928 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-28 10:23:03,928 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:03,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-02-28 10:23:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:03,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:03,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:04,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:04,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:04,117 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-02-28 10:23:04,117 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:04,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:04,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:04,122 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 3. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:23:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:04,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:04,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:23:04,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:04,145 INFO L442 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-02-28 10:23:04,157 INFO L442 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-02-28 10:23:04,179 INFO L442 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-02-28 10:23:04,205 INFO L442 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-02-28 10:23:04,205 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,211 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,218 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,226 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,235 INFO L315 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-02-28 10:23:04,235 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-02-28 10:23:04,248 INFO L442 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-02-28 10:23:04,248 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,249 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,249 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-02-28 10:23:04,255 INFO L442 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 18 treesize of output 13 [2019-02-28 10:23:04,256 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,257 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-02-28 10:23:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:04,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:04,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:23:04,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-02-28 10:23:04,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:23:04,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:23:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:23:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:04,300 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-02-28 10:23:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:04,455 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-02-28 10:23:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:23:04,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 10:23:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:04,459 INFO L225 Difference]: With dead ends: 357 [2019-02-28 10:23:04,459 INFO L226 Difference]: Without dead ends: 353 [2019-02-28 10:23:04,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-02-28 10:23:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-02-28 10:23:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-28 10:23:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-02-28 10:23:04,592 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-02-28 10:23:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:04,592 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-02-28 10:23:04,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:23:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-02-28 10:23:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:04,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:04,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:04,594 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-02-28 10:23:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:04,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:04,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,875 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-28 10:23:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:04,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:04,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:04,948 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-28 10:23:04,949 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:04,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:04,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:04,952 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:04,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:04,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:04,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:04,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:04,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:04,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:04,969 INFO L442 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-02-28 10:23:04,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,971 INFO L442 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-02-28 10:23:04,974 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,977 INFO L442 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-02-28 10:23:04,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:04,987 INFO L442 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-02-28 10:23:04,988 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:04,996 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,005 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,013 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,028 INFO L315 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-02-28 10:23:05,028 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:05,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,049 INFO L442 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-02-28 10:23:05,050 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,063 INFO L315 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-02-28 10:23:05,063 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:05,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,085 INFO L442 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-02-28 10:23:05,085 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:05,100 INFO L315 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-02-28 10:23:05,101 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:05,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:05,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:23:05,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:05,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:05,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:05,165 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-02-28 10:23:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:05,506 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-02-28 10:23:05,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:05,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:23:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:05,510 INFO L225 Difference]: With dead ends: 348 [2019-02-28 10:23:05,511 INFO L226 Difference]: Without dead ends: 338 [2019-02-28 10:23:05,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-28 10:23:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-02-28 10:23:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-28 10:23:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-02-28 10:23:05,598 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-02-28 10:23:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:05,598 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-02-28 10:23:05,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-02-28 10:23:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:05,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:05,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:05,600 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-28 10:23:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:05,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:05,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:05,874 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-02-28 10:23:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:05,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:05,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:05,947 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:05,947 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-28 10:23:05,948 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:05,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:05,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:05,951 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:05,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:05,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:05,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:05,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:05,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:05,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:05,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:05,974 INFO L442 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-02-28 10:23:05,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,978 INFO L442 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-02-28 10:23:05,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,985 INFO L442 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-02-28 10:23:05,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:05,995 INFO L442 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-02-28 10:23:05,995 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,004 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,012 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,021 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,035 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,035 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:06,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,059 INFO L442 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-02-28 10:23:06,060 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,074 INFO L315 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-02-28 10:23:06,075 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:06,095 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,101 INFO L442 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-02-28 10:23:06,102 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,116 INFO L315 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-02-28 10:23:06,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:06,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,139 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,141 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,143 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:06,144 INFO L442 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-02-28 10:23:06,145 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:06,160 INFO L315 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-02-28 10:23:06,160 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:06,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:06,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:06,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:06,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:06,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:06,243 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-02-28 10:23:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:06,702 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-02-28 10:23:06,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:06,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:23:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:06,706 INFO L225 Difference]: With dead ends: 348 [2019-02-28 10:23:06,706 INFO L226 Difference]: Without dead ends: 343 [2019-02-28 10:23:06,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-28 10:23:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-02-28 10:23:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-02-28 10:23:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-02-28 10:23:06,828 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-02-28 10:23:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:06,829 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-02-28 10:23:06,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-02-28 10:23:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:06,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:06,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:06,830 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-28 10:23:06,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:06,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:06,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:06,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:06,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:07,033 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-02-28 10:23:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:07,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:07,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:07,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:07,131 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-28 10:23:07,133 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:07,133 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:07,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:07,135 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:07,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:07,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:07,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:07,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:07,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:07,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:07,154 INFO L442 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-02-28 10:23:07,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,159 INFO L442 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-02-28 10:23:07,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,163 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,165 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,166 INFO L442 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-02-28 10:23:07,168 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,169 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,171 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,174 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,175 INFO L442 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-02-28 10:23:07,176 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,189 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,196 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,204 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,219 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,219 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:07,238 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,239 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,240 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,241 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,243 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,244 INFO L442 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-02-28 10:23:07,245 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,258 INFO L315 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-02-28 10:23:07,259 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:07,281 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,284 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,285 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,286 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,287 INFO L442 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-02-28 10:23:07,288 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,302 INFO L315 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-02-28 10:23:07,303 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:07,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,328 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,330 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,330 INFO L442 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-02-28 10:23:07,331 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,344 INFO L315 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-02-28 10:23:07,345 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:07,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,367 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:07,372 INFO L442 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-02-28 10:23:07,372 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:07,387 INFO L315 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-02-28 10:23:07,388 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:07,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:07,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:07,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:23:07,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:07,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:07,471 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-02-28 10:23:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:08,091 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-02-28 10:23:08,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:08,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:23:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:08,096 INFO L225 Difference]: With dead ends: 457 [2019-02-28 10:23:08,096 INFO L226 Difference]: Without dead ends: 456 [2019-02-28 10:23:08,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:23:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-02-28 10:23:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-02-28 10:23:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-28 10:23:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-02-28 10:23:08,213 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-02-28 10:23:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:08,213 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-02-28 10:23:08,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-02-28 10:23:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:08,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:08,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:08,214 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:08,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:08,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-28 10:23:08,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:08,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:08,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:08,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:08,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:08,576 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2019-02-28 10:23:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:08,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:08,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:08,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:08,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:08,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:08,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:08,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:08,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:08,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:08,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:08,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:08,732 INFO L442 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-02-28 10:23:08,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,758 INFO L442 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-02-28 10:23:08,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,763 INFO L442 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-02-28 10:23:08,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,771 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,773 INFO L442 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-02-28 10:23:08,773 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,782 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,789 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,796 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,810 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,811 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:08,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,836 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,839 INFO L442 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-02-28 10:23:08,840 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,853 INFO L315 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-02-28 10:23:08,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:08,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,884 INFO L442 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-02-28 10:23:08,885 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,898 INFO L315 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-02-28 10:23:08,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:08,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,927 INFO L442 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-02-28 10:23:08,927 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,944 INFO L315 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-02-28 10:23:08,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:08,967 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:08,973 INFO L442 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-02-28 10:23:08,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:08,988 INFO L315 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-02-28 10:23:08,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:09,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:09,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:09,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:23:09,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:09,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:23:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:23:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:09,080 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-02-28 10:23:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:09,612 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-02-28 10:23:09,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:09,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:23:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:09,617 INFO L225 Difference]: With dead ends: 346 [2019-02-28 10:23:09,617 INFO L226 Difference]: Without dead ends: 345 [2019-02-28 10:23:09,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:23:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-02-28 10:23:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-02-28 10:23:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:23:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-02-28 10:23:09,690 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-02-28 10:23:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:09,690 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-02-28 10:23:09,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:23:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-02-28 10:23:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:09,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:09,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:09,691 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-02-28 10:23:09,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:09,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:09,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:09,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:09,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:09,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:09,804 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-28 10:23:09,805 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:09,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:09,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:09,808 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:09,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:09,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:09,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:09,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:09,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:09,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:09,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:09,826 INFO L442 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-02-28 10:23:09,840 INFO L442 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-02-28 10:23:09,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,857 INFO L442 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-02-28 10:23:09,861 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,873 INFO L442 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-02-28 10:23:09,873 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:09,880 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:09,889 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:09,897 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:09,910 INFO L315 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-02-28 10:23:09,910 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-28 10:23:09,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,958 INFO L442 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-02-28 10:23:09,959 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:09,969 INFO L315 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-02-28 10:23:09,969 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:09,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:09,990 INFO L442 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-02-28 10:23:09,990 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,001 INFO L315 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-02-28 10:23:10,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-02-28 10:23:10,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,024 INFO L442 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-02-28 10:23:10,025 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,036 INFO L315 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-02-28 10:23:10,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-02-28 10:23:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:10,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:10,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:10,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:10,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:10,109 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-02-28 10:23:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:10,493 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-02-28 10:23:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:10,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:23:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:10,496 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:23:10,496 INFO L226 Difference]: Without dead ends: 277 [2019-02-28 10:23:10,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-02-28 10:23:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-02-28 10:23:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-28 10:23:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-02-28 10:23:10,601 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-02-28 10:23:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:10,601 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-02-28 10:23:10,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-02-28 10:23:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:10,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:10,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:10,602 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-02-28 10:23:10,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:10,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:10,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:10,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:10,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:10,727 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:10,727 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-02-28 10:23:10,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:10,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:10,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:10,731 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:10,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:10,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:10,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:10,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:10,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:10,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:23:10,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:10,751 INFO L442 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-02-28 10:23:10,766 INFO L442 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-02-28 10:23:10,783 INFO L442 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-02-28 10:23:10,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,802 INFO L442 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-02-28 10:23:10,803 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,811 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,819 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,828 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,838 INFO L315 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-02-28 10:23:10,838 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-02-28 10:23:10,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,857 INFO L442 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-02-28 10:23:10,858 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,863 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-02-28 10:23:10,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:10,876 INFO L442 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-02-28 10:23:10,876 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:10,881 INFO L315 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-02-28 10:23:10,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-02-28 10:23:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:10,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:10,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-28 10:23:10,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:10,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:23:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:23:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:23:10,930 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-02-28 10:23:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:11,258 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-02-28 10:23:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:11,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-28 10:23:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:11,262 INFO L225 Difference]: With dead ends: 390 [2019-02-28 10:23:11,262 INFO L226 Difference]: Without dead ends: 377 [2019-02-28 10:23:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-02-28 10:23:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-02-28 10:23:11,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-28 10:23:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-02-28 10:23:11,391 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-02-28 10:23:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:11,391 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-02-28 10:23:11,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:23:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-02-28 10:23:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:11,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:11,393 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-28 10:23:11,393 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-02-28 10:23:11,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:11,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:11,711 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-02-28 10:23:11,934 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-02-28 10:23:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:11,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:11,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:11,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:11,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:11,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:11,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:12,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:12,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:12,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:12,013 INFO L442 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-02-28 10:23:12,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,015 INFO L442 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-02-28 10:23:12,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,020 INFO L442 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-02-28 10:23:12,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,029 INFO L442 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-02-28 10:23:12,030 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,038 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,046 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,055 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,069 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,070 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:12,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,096 INFO L442 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-02-28 10:23:12,097 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,109 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:12,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,138 INFO L442 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-02-28 10:23:12,138 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,153 INFO L315 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-02-28 10:23:12,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:12,176 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,177 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,178 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,179 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,180 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,181 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,182 INFO L442 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-02-28 10:23:12,182 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,197 INFO L315 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-02-28 10:23:12,197 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:12,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,219 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,224 INFO L442 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-02-28 10:23:12,225 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,240 INFO L315 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-02-28 10:23:12,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:12,265 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,267 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:12,271 INFO L442 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-02-28 10:23:12,271 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:12,289 INFO L315 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-02-28 10:23:12,289 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:12,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:12,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:12,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-28 10:23:12,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:12,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:23:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:23:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:23:12,426 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-02-28 10:23:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:13,086 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-02-28 10:23:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:13,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-28 10:23:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:13,089 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:23:13,089 INFO L226 Difference]: Without dead ends: 374 [2019-02-28 10:23:13,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:23:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-28 10:23:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-02-28 10:23:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:23:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-02-28 10:23:13,201 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-02-28 10:23:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:13,202 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-02-28 10:23:13,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:23:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-02-28 10:23:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:13,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:13,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:13,203 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-02-28 10:23:13,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:13,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:13,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:13,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:13,345 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-28 10:23:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:13,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:13,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:13,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:13,398 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-28 10:23:13,398 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:13,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:13,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:13,401 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:23:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:13,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:13,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:13,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:13,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:13,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:13,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:13,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:13,420 INFO L442 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-02-28 10:23:13,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,422 INFO L442 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-02-28 10:23:13,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,430 INFO L442 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-02-28 10:23:13,433 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,437 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,444 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,445 INFO L442 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-02-28 10:23:13,445 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,452 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,459 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,467 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,482 INFO L315 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-02-28 10:23:13,482 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:13,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,503 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,506 INFO L442 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-02-28 10:23:13,506 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,521 INFO L315 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-02-28 10:23:13,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:13,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:13,546 INFO L442 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-02-28 10:23:13,546 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:13,581 INFO L315 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-02-28 10:23:13,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:13,598 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:23:13,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:13,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:23:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:23:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:23:13,637 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-02-28 10:23:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:13,929 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-02-28 10:23:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:23:13,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:23:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:13,931 INFO L225 Difference]: With dead ends: 157 [2019-02-28 10:23:13,931 INFO L226 Difference]: Without dead ends: 150 [2019-02-28 10:23:13,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-28 10:23:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-28 10:23:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:23:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-02-28 10:23:14,054 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-02-28 10:23:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:14,054 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-02-28 10:23:14,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:23:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-02-28 10:23:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:14,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:14,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:14,055 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-28 10:23:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:14,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:14,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:14,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:14,220 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:23:14,220 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-28 10:23:14,221 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:14,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:14,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:14,224 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 3. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:14,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:14,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:14,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:14,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:14,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:14,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:14,253 INFO L442 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-02-28 10:23:14,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,256 INFO L442 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-02-28 10:23:14,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,263 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,264 INFO L442 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-02-28 10:23:14,267 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,274 INFO L442 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-02-28 10:23:14,274 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,282 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,291 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,299 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,314 INFO L315 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-02-28 10:23:14,314 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:14,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,340 INFO L442 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-02-28 10:23:14,340 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,355 INFO L315 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-02-28 10:23:14,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:14,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,471 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,476 INFO L442 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-02-28 10:23:14,476 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,490 INFO L315 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-02-28 10:23:14,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:14,510 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:14,516 INFO L442 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-02-28 10:23:14,517 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:14,530 INFO L315 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-02-28 10:23:14,531 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:14,552 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:14,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:14,611 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-02-28 10:23:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:15,122 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-02-28 10:23:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:15,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:23:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:15,125 INFO L225 Difference]: With dead ends: 206 [2019-02-28 10:23:15,125 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:23:15,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:15,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:23:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-02-28 10:23:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-28 10:23:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-02-28 10:23:15,296 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-02-28 10:23:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:15,296 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-02-28 10:23:15,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-02-28 10:23:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:23:15,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:15,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:15,297 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:15,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-28 10:23:15,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:15,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:15,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:15,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:15,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:15,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:15,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:15,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:15,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:15,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:15,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:15,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:15,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:15,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:23:15,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:15,473 INFO L442 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-02-28 10:23:15,480 INFO L442 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-02-28 10:23:15,483 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,491 INFO L442 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-02-28 10:23:15,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,508 INFO L442 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-02-28 10:23:15,508 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,515 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,523 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,531 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,542 INFO L315 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-02-28 10:23:15,542 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-02-28 10:23:15,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,571 INFO L442 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-02-28 10:23:15,572 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,581 INFO L315 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-02-28 10:23:15,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-02-28 10:23:15,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,600 INFO L442 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-02-28 10:23:15,600 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,610 INFO L315 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-02-28 10:23:15,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-02-28 10:23:15,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:15,632 INFO L442 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-02-28 10:23:15,632 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,643 INFO L315 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-02-28 10:23:15,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2019-02-28 10:23:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:15,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:23:15,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:15,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:23:15,715 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-02-28 10:23:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:16,184 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-02-28 10:23:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:16,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:23:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:16,187 INFO L225 Difference]: With dead ends: 161 [2019-02-28 10:23:16,187 INFO L226 Difference]: Without dead ends: 156 [2019-02-28 10:23:16,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-28 10:23:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-02-28 10:23:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:23:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-02-28 10:23:16,251 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-02-28 10:23:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:16,251 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-02-28 10:23:16,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-02-28 10:23:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:23:16,251 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:16,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:16,251 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-02-28 10:23:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:16,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:16,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:16,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:16,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:23:16,407 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-28 10:23:16,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:16,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:16,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:16,411 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:16,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:16,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:16,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:16,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:16,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:16,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:16,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:16,432 INFO L442 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-02-28 10:23:16,439 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,439 INFO L442 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-02-28 10:23:16,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,503 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,523 INFO L442 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-02-28 10:23:16,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,532 INFO L442 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-02-28 10:23:16,532 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,541 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,549 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,557 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,572 INFO L315 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-02-28 10:23:16,572 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:16,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,596 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,598 INFO L442 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-02-28 10:23:16,599 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,613 INFO L315 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-02-28 10:23:16,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:16,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,635 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,640 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,640 INFO L442 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-02-28 10:23:16,641 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,673 INFO L315 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-02-28 10:23:16,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:16,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,698 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:16,699 INFO L442 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-02-28 10:23:16,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:16,714 INFO L315 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-02-28 10:23:16,714 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:16,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:16,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:23:16,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:16,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:16,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:23:16,785 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-02-28 10:23:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:17,177 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-02-28 10:23:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:23:17,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-28 10:23:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:17,179 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:23:17,179 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:23:17,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:23:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-28 10:23:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:23:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-28 10:23:17,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-28 10:23:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:17,277 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-28 10:23:17,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-28 10:23:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:23:17,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:17,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:17,278 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-02-28 10:23:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:17,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:17,856 WARN L181 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-02-28 10:23:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:23:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:17,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:17,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:23:17,883 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-02-28 10:23:17,883 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:17,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:17,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:17,890 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:17,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:17,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:17,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:17,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:17,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:23:17,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:17,910 INFO L442 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-02-28 10:23:17,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,912 INFO L442 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-02-28 10:23:17,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,917 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,918 INFO L442 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-02-28 10:23:17,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,927 INFO L442 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-02-28 10:23:17,927 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,936 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,944 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,953 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,965 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:17,966 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:17,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,988 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:17,991 INFO L442 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-02-28 10:23:17,991 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,006 INFO L315 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-02-28 10:23:18,006 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:18,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,032 INFO L442 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-02-28 10:23:18,033 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,047 INFO L315 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-02-28 10:23:18,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:18,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,073 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,075 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,076 INFO L442 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-02-28 10:23:18,076 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,091 INFO L315 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-02-28 10:23:18,092 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:18,114 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:18,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:18,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-02-28 10:23:18,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:18,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:23:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:23:18,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:23:18,168 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-02-28 10:23:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:18,566 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-02-28 10:23:18,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:23:18,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-28 10:23:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:18,567 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:23:18,567 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:23:18,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:23:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-02-28 10:23:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:23:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-02-28 10:23:18,690 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-02-28 10:23:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:18,690 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-02-28 10:23:18,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:23:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-02-28 10:23:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:23:18,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:18,691 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:18,691 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:18,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-02-28 10:23:18,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:18,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:18,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:23:18,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:18,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:18,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:18,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:18,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:18,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:18,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:18,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:18,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:18,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:18,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:18,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:18,831 INFO L442 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-02-28 10:23:18,838 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,838 INFO L442 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-02-28 10:23:18,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,845 INFO L442 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-02-28 10:23:18,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,853 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,853 INFO L442 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-02-28 10:23:18,854 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,863 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,873 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,883 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,898 INFO L315 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-02-28 10:23:18,898 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:18,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,936 INFO L442 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-02-28 10:23:18,936 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,950 INFO L315 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-02-28 10:23:18,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:18,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,970 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,972 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:18,973 INFO L442 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-02-28 10:23:18,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:18,988 INFO L315 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-02-28 10:23:18,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:19,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,018 INFO L442 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-02-28 10:23:19,018 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,033 INFO L315 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-02-28 10:23:19,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:19,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,056 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,058 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,059 INFO L442 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-02-28 10:23:19,060 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,077 INFO L315 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-02-28 10:23:19,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-02-28 10:23:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:19,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:19,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:19,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-28 10:23:19,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:19,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:19,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:19,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:19,161 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-02-28 10:23:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:19,664 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-02-28 10:23:19,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:19,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-28 10:23:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:19,665 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:23:19,665 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:23:19,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:23:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-02-28 10:23:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:23:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-02-28 10:23:19,756 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-02-28 10:23:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:19,756 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-02-28 10:23:19,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-02-28 10:23:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:23:19,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:19,757 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:19,757 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:19,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:19,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-02-28 10:23:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:19,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:19,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:19,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:23:19,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:19,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:19,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:23:19,846 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-02-28 10:23:19,846 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:19,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:19,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:19,849 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 3. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-28 10:23:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:19,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:19,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:19,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:19,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:19,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:19,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:19,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:19,867 INFO L442 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-02-28 10:23:19,871 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,872 INFO L442 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-02-28 10:23:19,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,881 INFO L442 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-02-28 10:23:19,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,893 INFO L442 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-02-28 10:23:19,894 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,900 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,908 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,916 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,931 INFO L315 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-02-28 10:23:19,931 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:19,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,956 INFO L442 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-02-28 10:23:19,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:19,969 INFO L315 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-02-28 10:23:19,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:19,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:19,995 INFO L442 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-02-28 10:23:19,995 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,010 INFO L315 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-02-28 10:23:20,011 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:20,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,039 INFO L442 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-02-28 10:23:20,039 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,054 INFO L315 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-02-28 10:23:20,054 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:20,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,082 INFO L442 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-02-28 10:23:20,083 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,098 INFO L315 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-02-28 10:23:20,099 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-28 10:23:20,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:23:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:23:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:23:20,176 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-02-28 10:23:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:20,561 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-02-28 10:23:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:20,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-28 10:23:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:20,562 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:23:20,562 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:23:20,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:23:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:23:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-02-28 10:23:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:23:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-02-28 10:23:20,686 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-02-28 10:23:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:20,686 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-02-28 10:23:20,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:23:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-02-28 10:23:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:23:20,686 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:20,687 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:20,687 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-02-28 10:23:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:20,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:23:20,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:20,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:20,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:20,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:20,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:20,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:20,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:20,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:20,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:23:20,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:20,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:20,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:20,858 INFO L442 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-02-28 10:23:20,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,864 INFO L442 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-02-28 10:23:20,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,869 INFO L442 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-02-28 10:23:20,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,880 INFO L442 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-02-28 10:23:20,880 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,888 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,896 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,903 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,923 INFO L315 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-02-28 10:23:20,924 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:20,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:20,958 INFO L442 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-02-28 10:23:20,958 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:20,984 INFO L315 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-02-28 10:23:20,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:21,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,010 INFO L442 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-02-28 10:23:21,010 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,025 INFO L315 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-02-28 10:23:21,025 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:21,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,051 INFO L442 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-02-28 10:23:21,052 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,077 INFO L315 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-02-28 10:23:21,078 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:21,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:21,103 INFO L442 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-02-28 10:23:21,104 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:21,116 INFO L315 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-02-28 10:23:21,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:21,136 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:21,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:21,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:23:21,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:21,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:23:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:23:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:21,203 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-02-28 10:23:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:21,654 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-02-28 10:23:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:23:21,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-28 10:23:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:21,657 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:23:21,657 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:23:21,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:23:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:23:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-02-28 10:23:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:23:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-02-28 10:23:21,802 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-02-28 10:23:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:21,802 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-02-28 10:23:21,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:23:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-02-28 10:23:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:23:21,803 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:21,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:21,803 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-02-28 10:23:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:21,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:21,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:23:22,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:22,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:22,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:23:22,083 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-02-28 10:23:22,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:23:22,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:23:22,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:23:22,087 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:23:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:22,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:23:22,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:22,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:22,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:22,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:22,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:23:22,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:22,107 INFO L442 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-02-28 10:23:22,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,109 INFO L442 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-02-28 10:23:22,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,117 INFO L442 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-02-28 10:23:22,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,133 INFO L442 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-02-28 10:23:22,133 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,146 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,157 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,167 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,184 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,184 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:22,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,224 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,227 INFO L442 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-02-28 10:23:22,227 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,251 INFO L315 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-02-28 10:23:22,252 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-02-28 10:23:22,288 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,290 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,301 INFO L442 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-02-28 10:23:22,302 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,319 INFO L315 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-02-28 10:23:22,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:22,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,377 INFO L442 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-02-28 10:23:22,378 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,394 INFO L315 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-02-28 10:23:22,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:22,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,421 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,422 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,423 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,426 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:22,426 INFO L442 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-02-28 10:23:22,427 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:22,442 INFO L315 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-02-28 10:23:22,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:22,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:22,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:22,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:23:22,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:22,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:22,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:23:22,591 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-02-28 10:23:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:23,151 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-02-28 10:23:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:23,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:23:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:23,152 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:23:23,153 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:23:23,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:23:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:23:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-02-28 10:23:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:23:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-02-28 10:23:23,318 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-02-28 10:23:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:23,319 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-02-28 10:23:23,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-02-28 10:23:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:23:23,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:23,319 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:23:23,319 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:23,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-02-28 10:23:23,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:23,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:23,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:23,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:23:23,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:23,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:23,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:23,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:23,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:23,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 10:23:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:23:23,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:23:23,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:23:23,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:23:23,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:23:23,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:23,624 INFO L442 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-02-28 10:23:23,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,629 INFO L442 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-02-28 10:23:23,637 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,639 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,642 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,642 INFO L442 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-02-28 10:23:23,646 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,648 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,649 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,650 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,654 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,655 INFO L442 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-02-28 10:23:23,656 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,690 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,696 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,705 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,718 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,718 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-02-28 10:23:23,740 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,741 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,742 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,745 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,746 INFO L442 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-02-28 10:23:23,746 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,761 INFO L315 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-02-28 10:23:23,761 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-02-28 10:23:23,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,789 INFO L442 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-02-28 10:23:23,789 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,820 INFO L315 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-02-28 10:23:23,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-02-28 10:23:23,841 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,845 INFO L442 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-02-28 10:23:23,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,862 INFO L315 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-02-28 10:23:23,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:23,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,891 INFO L442 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-02-28 10:23:23,892 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,905 INFO L315 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-02-28 10:23:23,906 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:23,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:23:23,935 INFO L442 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-02-28 10:23:23,936 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:23,950 INFO L315 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-02-28 10:23:23,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-02-28 10:23:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:23,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:24,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:24,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-02-28 10:23:24,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:24,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:23:24,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:23:24,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:23:24,062 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-02-28 10:23:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:24,678 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-02-28 10:23:24,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:23:24,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-28 10:23:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:24,679 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:23:24,679 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:23:24,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:23:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:23:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:23:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:23:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:23:24,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-02-28 10:23:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:24,682 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:23:24,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:23:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:23:24,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:23:24,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:23:24,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:24,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:24,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:25,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:26,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:27,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:28,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:29,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:30,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:30,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:30,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:30,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:31,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:32,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:34,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:34,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:34,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:34,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:23:34,801 WARN L181 SmtUtils]: Spent 10.11 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-02-28 10:23:48,915 WARN L181 SmtUtils]: Spent 14.02 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-02-28 10:23:48,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:23:48,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-02-28 10:23:48,920 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-02-28 10:23:48,920 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L444 ceAbstractionStarter]: At program point L36-1(lines 31 41) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1)))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse18 (- 1)))) (.cse19 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse7 (= .cse18 0)) (.cse5 (<= 0 .cse19)) (.cse2 (select .cse17 ULTIMATE.start_main_p3)) (.cse4 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4)) (.cse3 (= 0 (select .cse10 ULTIMATE.start_main_p1))) (.cse1 (= 0 (select .cse17 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse9 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse19 1)))) (or (and (and (and .cse0 .cse1) (<= 1 .cse2) .cse3) (<= (+ (select .cse4 ULTIMATE.start_main_p4) 1) 0)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse5 (<= 0 .cse6) .cse7 (<= .cse8 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (let ((.cse11 (select .cse4 ULTIMATE.start_main_p2))) (let ((.cse14 (<= .cse18 0)) (.cse15 (<= (+ .cse11 1) 0)) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and (= 0 (select .cse9 ULTIMATE.start_main_p1)) (<= 1 (select .cse10 ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 .cse11) .cse0 .cse7) (and (and .cse12 .cse13 .cse14 .cse5 .cse15 .cse3) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p3))) (and (and .cse14 (let ((.cse16 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select .cse17 ULTIMATE.start_main_p1)) .cse12))) (or (and .cse1 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse16) (and .cse15 .cse16)))) (<= 0 .cse2))))) (and .cse0 .cse3 .cse1 (= .cse19 0) .cse13 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select .cse9 ULTIMATE.start_main_p4) 1) 0)))))) [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-02-28 10:23:48,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-02-28 10:23:48,937 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:23:48 BoogieIcfgContainer [2019-02-28 10:23:48,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:23:48,939 INFO L168 Benchmark]: Toolchain (without parser) took 83929.01 ms. Allocated memory was 133.2 MB in the beginning and 829.4 MB in the end (delta: 696.3 MB). Free memory was 108.4 MB in the beginning and 43.5 MB in the end (delta: 64.9 MB). Peak memory consumption was 762.7 MB. Max. memory is 7.1 GB. [2019-02-28 10:23:48,939 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:23:48,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.40 ms. Allocated memory is still 133.2 MB. Free memory was 108.2 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-02-28 10:23:48,940 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 ms. Allocated memory is still 133.2 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:23:48,940 INFO L168 Benchmark]: RCFGBuilder took 280.79 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 94.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:23:48,940 INFO L168 Benchmark]: TraceAbstraction took 83542.81 ms. Allocated memory was 133.2 MB in the beginning and 829.4 MB in the end (delta: 696.3 MB). Free memory was 94.2 MB in the beginning and 43.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 748.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:23:48,942 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.22 ms. Allocated memory is still 133.2 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.40 ms. Allocated memory is still 133.2 MB. Free memory was 108.2 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 33.64 ms. Allocated memory is still 133.2 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 280.79 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 94.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83542.81 ms. Allocated memory was 133.2 MB in the beginning and 829.4 MB in the end (delta: 696.3 MB). Free memory was 94.2 MB in the beginning and 43.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 748.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: 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 - PositiveResult [Line: 46]: 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: ((((((p1 + 3 <= p4 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || ((((((p3 < p4 && p2 < p3) && 0 <= #memory_int[p3]) && 0 <= #memory_int[p1]) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p1 < p2)) || ((((((0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p3]) && !(p2 == p4)) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && p1 + 3 <= p4) && #memory_int[p4] == 0) || ((((((!(p1 == p4) && !(p1 == p3)) && #memory_int[p4] <= 0) && 0 <= #memory_int[p3]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && !(p4 == p3))) || ((#memory_int[p4] <= 0 && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)))) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3])) || ((((((p1 + 3 <= p4 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 83.4s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 23.0s AutomataDifference, 0.0s DeadEndRemovalTime, 24.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 43 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 1522 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 64 NumberOfFragments, 342 HoareAnnotationTreeSize, 1 FomulaSimplifications, 181006621 FormulaSimplificationTreeSizeReduction, 10.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 14.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 802 ConstructedInterpolants, 235 QuantifiedInterpolants, 90984 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1237 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 165 InterpolantComputations, 7 PerfectInterpolantSequences, 158/841 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...