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_array_oct.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:33:59,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:33:59,358 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:33:59,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:33:59,380 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:33:59,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:33:59,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:33:59,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:33:59,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:33:59,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:33:59,393 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:33:59,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:33:59,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:33:59,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:33:59,397 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:33:59,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:33:59,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:33:59,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:33:59,417 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:33:59,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:33:59,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:33:59,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:33:59,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:33:59,423 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:33:59,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:33:59,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:33:59,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:33:59,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:33:59,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:33:59,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:33:59,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:33:59,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:33:59,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:33:59,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:33:59,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:33:59,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:33:59,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:33:59,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:33:59,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:33:59,448 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:33:59,448 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:33:59,448 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:33:59,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:33:59,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:33:59,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:33:59,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:33:59,449 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:33:59,450 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:33:59,450 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:33:59,450 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:33:59,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:33:59,451 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:33:59,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:33:59,452 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:33:59,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:33:59,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:33:59,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:33:59,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:33:59,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:33:59,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:33:59,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:33:59,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:33:59,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:33:59,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:33:59,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:33:59,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:33:59,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:33:59,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:33:59,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:33:59,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:33:59,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:33:59,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:33:59,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:33:59,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:33:59,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:33:59,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:33:59,457 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:33:59,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:33:59,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:33:59,512 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:33:59,514 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:33:59,515 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:33:59,516 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-12-03 18:33:59,516 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-12-03 18:33:59,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:33:59,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:33:59,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:59,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:33:59,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:33:59,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,658 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:33:59,658 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:33:59,658 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:33:59,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:59,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:33:59,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:33:59,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:33:59,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... [2018-12-03 18:33:59,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:33:59,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:33:59,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:33:59,723 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:33:59,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:33:59,792 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-12-03 18:33:59,792 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-12-03 18:33:59,793 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-12-03 18:34:00,528 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:34:00,528 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:34:00,529 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:00 BoogieIcfgContainer [2018-12-03 18:34:00,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:34:00,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:34:00,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:34:00,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:34:00,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:59" (1/2) ... [2018-12-03 18:34:00,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14134230 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:34:00, skipping insertion in model container [2018-12-03 18:34:00,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:00" (2/2) ... [2018-12-03 18:34:00,536 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-12-03 18:34:00,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:34:00,555 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-12-03 18:34:00,573 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-12-03 18:34:00,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:34:00,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:34:00,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:34:00,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:34:00,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:34:00,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:34:00,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:34:00,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:34:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-03 18:34:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:34:00,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:00,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:00,644 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:00,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-12-03 18:34:00,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:00,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:00,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:00,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:00,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:00,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:01,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:34:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:34:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:01,017 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-12-03 18:34:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:02,912 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-12-03 18:34:02,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:34:02,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 18:34:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:02,932 INFO L225 Difference]: With dead ends: 163 [2018-12-03 18:34:02,933 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 18:34:02,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 18:34:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-12-03 18:34:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 18:34:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-12-03 18:34:02,998 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-12-03 18:34:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:02,999 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-12-03 18:34:02,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:34:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-12-03 18:34:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:34:03,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:03,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:03,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:03,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-12-03 18:34:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:03,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:03,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:03,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:03,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:34:03,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:34:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:34:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:34:03,150 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-12-03 18:34:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:04,099 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-12-03 18:34:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:34:04,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-12-03 18:34:04,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:04,107 INFO L225 Difference]: With dead ends: 188 [2018-12-03 18:34:04,107 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 18:34:04,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 18:34:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-12-03 18:34:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 18:34:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-12-03 18:34:04,159 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-12-03 18:34:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:04,160 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-12-03 18:34:04,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:34:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-12-03 18:34:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:34:04,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:04,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:04,165 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:04,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-12-03 18:34:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:04,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:04,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:04,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:34:04,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:04,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:34:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:34:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:34:04,272 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-12-03 18:34:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:06,099 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-12-03 18:34:06,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:34:06,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 18:34:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:06,105 INFO L225 Difference]: With dead ends: 361 [2018-12-03 18:34:06,105 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 18:34:06,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:34:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 18:34:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-12-03 18:34:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 18:34:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-12-03 18:34:06,146 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-12-03 18:34:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:06,146 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-12-03 18:34:06,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:34:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-12-03 18:34:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:34:06,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:06,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:06,149 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:06,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-12-03 18:34:06,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:06,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:06,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:06,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:06,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:34:06,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:34:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:34:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:34:06,250 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-12-03 18:34:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:07,720 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-12-03 18:34:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:34:07,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 18:34:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:07,723 INFO L225 Difference]: With dead ends: 307 [2018-12-03 18:34:07,724 INFO L226 Difference]: Without dead ends: 302 [2018-12-03 18:34:07,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:34:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-03 18:34:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-12-03 18:34:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 18:34:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-12-03 18:34:07,764 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-12-03 18:34:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:07,764 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-12-03 18:34:07,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:34:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-12-03 18:34:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:07,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:07,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:07,767 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:07,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-12-03 18:34:07,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:07,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:08,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:08,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:08,110 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-12-03 18:34:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:12,761 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-12-03 18:34:12,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:34:12,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:12,770 INFO L225 Difference]: With dead ends: 741 [2018-12-03 18:34:12,770 INFO L226 Difference]: Without dead ends: 733 [2018-12-03 18:34:12,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:34:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-12-03 18:34:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-12-03 18:34:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 18:34:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-12-03 18:34:12,832 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-12-03 18:34:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:12,833 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-12-03 18:34:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-12-03 18:34:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:12,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:12,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:12,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:12,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-12-03 18:34:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:12,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:12,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:12,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:12,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:12,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:12,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:12,968 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-12-03 18:34:18,563 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 18:34:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:18,992 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-12-03 18:34:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:34:18,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:19,000 INFO L225 Difference]: With dead ends: 797 [2018-12-03 18:34:19,000 INFO L226 Difference]: Without dead ends: 789 [2018-12-03 18:34:19,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:34:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-03 18:34:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-12-03 18:34:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 18:34:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-12-03 18:34:19,072 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-12-03 18:34:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:19,073 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-12-03 18:34:19,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-12-03 18:34:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:19,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:19,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:19,075 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:19,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-12-03 18:34:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:19,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:19,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:19,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:19,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:19,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:19,203 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-12-03 18:34:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:21,493 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-12-03 18:34:21,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:34:21,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:21,506 INFO L225 Difference]: With dead ends: 684 [2018-12-03 18:34:21,506 INFO L226 Difference]: Without dead ends: 676 [2018-12-03 18:34:21,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:34:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-12-03 18:34:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-12-03 18:34:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-03 18:34:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-12-03 18:34:21,566 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-12-03 18:34:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:21,567 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-12-03 18:34:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-12-03 18:34:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:21,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:21,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:21,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:21,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-12-03 18:34:21,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:21,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:21,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:21,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:21,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:21,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:21,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:21,668 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-12-03 18:34:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:23,074 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-12-03 18:34:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:34:23,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:23,081 INFO L225 Difference]: With dead ends: 605 [2018-12-03 18:34:23,081 INFO L226 Difference]: Without dead ends: 597 [2018-12-03 18:34:23,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:34:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-12-03 18:34:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-12-03 18:34:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-12-03 18:34:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-12-03 18:34:23,146 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-12-03 18:34:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:23,147 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-12-03 18:34:23,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-12-03 18:34:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:23,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:23,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:23,149 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:23,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-12-03 18:34:23,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:23,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:23,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:23,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:23,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:23,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:23,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:23,546 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-12-03 18:34:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:25,778 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-12-03 18:34:25,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:34:25,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:25,786 INFO L225 Difference]: With dead ends: 935 [2018-12-03 18:34:25,786 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 18:34:25,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:34:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 18:34:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-12-03 18:34:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 18:34:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-12-03 18:34:25,876 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-12-03 18:34:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:25,876 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-12-03 18:34:25,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-12-03 18:34:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:25,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:25,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:25,878 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:25,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-12-03 18:34:25,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:25,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:25,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:25,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:25,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:25,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:25,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:25,955 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-12-03 18:34:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:28,085 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-12-03 18:34:28,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:34:28,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:28,091 INFO L225 Difference]: With dead ends: 923 [2018-12-03 18:34:28,092 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 18:34:28,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:34:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 18:34:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-12-03 18:34:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-03 18:34:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-12-03 18:34:28,194 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-12-03 18:34:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:28,194 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-12-03 18:34:28,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-12-03 18:34:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:28,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:28,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:28,196 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:28,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:28,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-12-03 18:34:28,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:28,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:28,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:28,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:28,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:28,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:28,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:28,497 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-12-03 18:34:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:30,176 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-12-03 18:34:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:34:30,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:30,181 INFO L225 Difference]: With dead ends: 837 [2018-12-03 18:34:30,181 INFO L226 Difference]: Without dead ends: 829 [2018-12-03 18:34:30,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:34:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-03 18:34:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-12-03 18:34:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 18:34:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-12-03 18:34:30,282 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-12-03 18:34:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:30,283 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-12-03 18:34:30,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-12-03 18:34:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:30,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:30,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:30,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:30,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-12-03 18:34:30,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:30,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:30,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:30,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:30,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:30,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:30,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:30,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:30,410 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-12-03 18:34:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:32,830 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-12-03 18:34:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:34:32,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:32,835 INFO L225 Difference]: With dead ends: 996 [2018-12-03 18:34:32,835 INFO L226 Difference]: Without dead ends: 988 [2018-12-03 18:34:32,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 18:34:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-12-03 18:34:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-12-03 18:34:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-03 18:34:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-12-03 18:34:32,952 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-12-03 18:34:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:32,954 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-12-03 18:34:32,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-12-03 18:34:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:32,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:32,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:32,955 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:32,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-12-03 18:34:32,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:32,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:33,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:33,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:33,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:33,088 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-12-03 18:34:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:35,039 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-12-03 18:34:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:34:35,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:35,047 INFO L225 Difference]: With dead ends: 913 [2018-12-03 18:34:35,047 INFO L226 Difference]: Without dead ends: 905 [2018-12-03 18:34:35,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:34:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-03 18:34:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-12-03 18:34:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 18:34:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-12-03 18:34:35,183 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-12-03 18:34:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:35,183 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-12-03 18:34:35,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-12-03 18:34:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:35,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:35,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:35,185 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:35,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-12-03 18:34:35,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:35,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:35,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:35,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:35,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:35,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:34:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:34:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:34:35,305 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-12-03 18:34:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:37,140 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-12-03 18:34:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:34:37,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 18:34:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:37,146 INFO L225 Difference]: With dead ends: 886 [2018-12-03 18:34:37,146 INFO L226 Difference]: Without dead ends: 878 [2018-12-03 18:34:37,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:34:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-12-03 18:34:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-12-03 18:34:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-03 18:34:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-12-03 18:34:37,269 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-12-03 18:34:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:37,269 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-12-03 18:34:37,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:34:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-12-03 18:34:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:37,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:37,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:37,271 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:37,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-12-03 18:34:37,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:37,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:37,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:37,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:37,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:37,363 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-12-03 18:34:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:39,373 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-12-03 18:34:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:34:39,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:39,379 INFO L225 Difference]: With dead ends: 801 [2018-12-03 18:34:39,379 INFO L226 Difference]: Without dead ends: 793 [2018-12-03 18:34:39,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:34:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-03 18:34:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-12-03 18:34:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-03 18:34:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-12-03 18:34:39,572 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-12-03 18:34:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:39,572 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-12-03 18:34:39,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-12-03 18:34:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:39,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:39,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:39,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:39,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:39,575 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-12-03 18:34:39,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:39,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:39,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:39,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:39,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:39,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:39,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:39,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:39,806 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-12-03 18:34:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:42,324 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-12-03 18:34:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:34:42,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:42,330 INFO L225 Difference]: With dead ends: 962 [2018-12-03 18:34:42,330 INFO L226 Difference]: Without dead ends: 954 [2018-12-03 18:34:42,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:34:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-12-03 18:34:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-12-03 18:34:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-03 18:34:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-12-03 18:34:42,493 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-12-03 18:34:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:42,493 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-12-03 18:34:42,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-12-03 18:34:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:42,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:42,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:42,495 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:42,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-12-03 18:34:42,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:42,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:42,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:42,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:42,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:42,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:42,596 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-12-03 18:34:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:44,956 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-12-03 18:34:44,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:34:44,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:44,961 INFO L225 Difference]: With dead ends: 1000 [2018-12-03 18:34:44,961 INFO L226 Difference]: Without dead ends: 992 [2018-12-03 18:34:44,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:34:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-12-03 18:34:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-12-03 18:34:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-03 18:34:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-12-03 18:34:45,136 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-12-03 18:34:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:45,136 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-12-03 18:34:45,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-12-03 18:34:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:45,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:45,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:45,138 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:45,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-12-03 18:34:45,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:45,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:45,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:45,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:45,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:45,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:45,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:45,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:45,246 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-12-03 18:34:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:48,273 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-12-03 18:34:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:34:48,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:48,278 INFO L225 Difference]: With dead ends: 1065 [2018-12-03 18:34:48,278 INFO L226 Difference]: Without dead ends: 1057 [2018-12-03 18:34:48,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:34:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-12-03 18:34:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-12-03 18:34:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-12-03 18:34:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-12-03 18:34:48,489 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-12-03 18:34:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-12-03 18:34:48,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-12-03 18:34:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:48,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:48,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:48,491 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:48,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-12-03 18:34:48,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:48,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:48,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:48,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:48,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:48,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:48,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:48,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:48,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:48,569 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-12-03 18:34:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:51,976 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-12-03 18:34:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:34:51,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:51,982 INFO L225 Difference]: With dead ends: 1227 [2018-12-03 18:34:51,982 INFO L226 Difference]: Without dead ends: 1219 [2018-12-03 18:34:51,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:34:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-12-03 18:34:52,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-12-03 18:34:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-03 18:34:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-12-03 18:34:52,195 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-12-03 18:34:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:52,195 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-12-03 18:34:52,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-12-03 18:34:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:52,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:52,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:52,196 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:52,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-12-03 18:34:52,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:52,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:52,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:52,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:52,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:52,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:52,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:52,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:52,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:52,287 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-12-03 18:34:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:55,157 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-12-03 18:34:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:34:55,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:55,163 INFO L225 Difference]: With dead ends: 1076 [2018-12-03 18:34:55,163 INFO L226 Difference]: Without dead ends: 1068 [2018-12-03 18:34:55,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:34:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-12-03 18:34:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-12-03 18:34:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 18:34:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-12-03 18:34:55,408 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-12-03 18:34:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:55,408 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-12-03 18:34:55,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-12-03 18:34:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:55,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:55,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:55,409 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:55,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-12-03 18:34:55,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:55,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:55,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:55,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:55,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:55,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:55,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:55,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:55,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:55,518 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-12-03 18:34:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:58,232 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-12-03 18:34:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:34:58,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:34:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:58,238 INFO L225 Difference]: With dead ends: 1111 [2018-12-03 18:34:58,238 INFO L226 Difference]: Without dead ends: 1103 [2018-12-03 18:34:58,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:34:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-12-03 18:34:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-12-03 18:34:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 18:34:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-12-03 18:34:58,559 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-12-03 18:34:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:58,559 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-12-03 18:34:58,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-12-03 18:34:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:34:58,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:58,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:34:58,561 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:58,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-12-03 18:34:58,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:58,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:58,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:58,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:58,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:34:58,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:34:58,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:34:58,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:34:58,647 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-12-03 18:35:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:02,240 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-12-03 18:35:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:35:02,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:35:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:02,248 INFO L225 Difference]: With dead ends: 1304 [2018-12-03 18:35:02,248 INFO L226 Difference]: Without dead ends: 1296 [2018-12-03 18:35:02,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:35:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-12-03 18:35:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-12-03 18:35:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-12-03 18:35:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-12-03 18:35:02,558 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-12-03 18:35:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:02,558 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-12-03 18:35:02,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-12-03 18:35:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:35:02,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:02,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:02,560 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-12-03 18:35:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:02,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:02,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:02,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:02,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:02,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:02,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:02,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:35:02,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:35:02,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:35:02,637 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-12-03 18:35:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:06,446 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-12-03 18:35:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:35:06,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:35:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:06,453 INFO L225 Difference]: With dead ends: 1370 [2018-12-03 18:35:06,453 INFO L226 Difference]: Without dead ends: 1362 [2018-12-03 18:35:06,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:35:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-12-03 18:35:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-12-03 18:35:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-12-03 18:35:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-12-03 18:35:06,780 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-12-03 18:35:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:06,781 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-12-03 18:35:06,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-12-03 18:35:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:35:06,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:06,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:06,782 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:06,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-12-03 18:35:06,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:06,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:06,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:06,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:06,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:06,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 18:35:06,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:06,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:35:06,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:35:06,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:35:06,931 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-12-03 18:35:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:09,837 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-12-03 18:35:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:35:09,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 18:35:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:09,842 INFO L225 Difference]: With dead ends: 1298 [2018-12-03 18:35:09,842 INFO L226 Difference]: Without dead ends: 1290 [2018-12-03 18:35:09,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:35:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-03 18:35:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-12-03 18:35:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-12-03 18:35:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-12-03 18:35:10,267 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-12-03 18:35:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-12-03 18:35:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:35:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-12-03 18:35:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:10,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:10,268 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:10,268 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:10,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-12-03 18:35:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:10,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:35:10,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 18:35:10,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:35:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:35:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 18:35:10,337 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-12-03 18:35:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:11,431 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-12-03 18:35:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:35:11,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 18:35:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:11,434 INFO L225 Difference]: With dead ends: 1242 [2018-12-03 18:35:11,434 INFO L226 Difference]: Without dead ends: 673 [2018-12-03 18:35:11,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 18:35:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-12-03 18:35:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-12-03 18:35:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 18:35:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-12-03 18:35:11,898 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-12-03 18:35:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:11,898 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-12-03 18:35:11,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:35:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-12-03 18:35:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:35:11,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:11,899 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:11,899 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:11,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-12-03 18:35:11,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:11,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:11,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:11,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:11,984 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 18:35:11,985 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [67], [72], [78], [279], [285], [286], [349] [2018-12-03 18:35:12,043 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:12,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:12,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:12,400 INFO L272 AbstractInterpreter]: Visited 11 different actions 36 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:35:12,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:12,447 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:12,509 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 57.52% of their original sizes. [2018-12-03 18:35:12,510 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:12,948 INFO L418 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2018-12-03 18:35:12,948 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:12,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:12,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 15 [2018-12-03 18:35:12,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:35:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:35:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:35:12,950 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 10 states. [2018-12-03 18:35:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:18,946 INFO L93 Difference]: Finished difference Result 982 states and 2293 transitions. [2018-12-03 18:35:18,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:35:18,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-12-03 18:35:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:18,950 INFO L225 Difference]: With dead ends: 982 [2018-12-03 18:35:18,950 INFO L226 Difference]: Without dead ends: 977 [2018-12-03 18:35:18,951 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:35:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-12-03 18:35:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 741. [2018-12-03 18:35:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 18:35:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1751 transitions. [2018-12-03 18:35:20,143 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1751 transitions. Word has length 13 [2018-12-03 18:35:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:20,144 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1751 transitions. [2018-12-03 18:35:20,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:35:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1751 transitions. [2018-12-03 18:35:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:35:20,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:20,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:20,146 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:20,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-12-03 18:35:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:20,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:20,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:20,276 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:35:20,276 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [113], [122], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 18:35:20,278 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:20,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:20,303 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:20,304 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:35:20,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,324 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:20,344 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60% of their original sizes. [2018-12-03 18:35:20,344 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:20,766 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:35:20,766 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:20,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:35:20,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:20,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:20,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:35:20,767 INFO L87 Difference]: Start difference. First operand 741 states and 1751 transitions. Second operand 13 states. [2018-12-03 18:35:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:51,616 INFO L93 Difference]: Finished difference Result 1829 states and 4262 transitions. [2018-12-03 18:35:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:35:51,616 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:35:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:51,620 INFO L225 Difference]: With dead ends: 1829 [2018-12-03 18:35:51,620 INFO L226 Difference]: Without dead ends: 1821 [2018-12-03 18:35:51,622 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=649, Invalid=1703, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:35:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-12-03 18:35:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1153. [2018-12-03 18:35:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-12-03 18:35:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2810 transitions. [2018-12-03 18:35:52,760 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2810 transitions. Word has length 16 [2018-12-03 18:35:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:52,760 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 2810 transitions. [2018-12-03 18:35:52,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:35:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2810 transitions. [2018-12-03 18:35:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:35:52,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:52,761 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:35:52,761 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:52,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:52,762 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-12-03 18:35:52,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:52,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:52,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:52,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:52,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:52,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:52,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:52,856 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:35:52,856 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [92], [115], [199], [203], [207], [236], [245], [254], [260], [274], [349] [2018-12-03 18:35:52,857 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:35:52,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:35:52,873 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:35:52,873 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:35:52,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:52,875 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:35:52,889 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.63% of their original sizes. [2018-12-03 18:35:52,889 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:35:53,016 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:35:53,017 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:35:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:35:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:35:53,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:35:53,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:35:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:35:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:35:53,018 INFO L87 Difference]: Start difference. First operand 1153 states and 2810 transitions. Second operand 13 states. [2018-12-03 18:36:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:05,500 INFO L93 Difference]: Finished difference Result 1887 states and 4411 transitions. [2018-12-03 18:36:05,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:36:05,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:05,505 INFO L225 Difference]: With dead ends: 1887 [2018-12-03 18:36:05,505 INFO L226 Difference]: Without dead ends: 1879 [2018-12-03 18:36:05,507 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1032, Invalid=3660, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 18:36:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-12-03 18:36:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1122. [2018-12-03 18:36:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-12-03 18:36:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2740 transitions. [2018-12-03 18:36:06,674 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2740 transitions. Word has length 16 [2018-12-03 18:36:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:06,674 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 2740 transitions. [2018-12-03 18:36:06,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2740 transitions. [2018-12-03 18:36:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:06,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:06,675 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:06,676 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:06,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-12-03 18:36:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:06,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:06,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:06,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:06,973 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:06,973 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [98], [115], [199], [203], [207], [236], [245], [260], [274], [349] [2018-12-03 18:36:06,974 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:06,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:06,990 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:06,990 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:36:06,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:06,997 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:07,011 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.86% of their original sizes. [2018-12-03 18:36:07,012 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:07,197 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:07,197 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:07,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:07,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:36:07,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:07,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:36:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:36:07,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:36:07,199 INFO L87 Difference]: Start difference. First operand 1122 states and 2740 transitions. Second operand 13 states. [2018-12-03 18:36:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:17,325 INFO L93 Difference]: Finished difference Result 1825 states and 4256 transitions. [2018-12-03 18:36:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:36:17,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:17,328 INFO L225 Difference]: With dead ends: 1825 [2018-12-03 18:36:17,329 INFO L226 Difference]: Without dead ends: 1817 [2018-12-03 18:36:17,330 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=727, Invalid=2579, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:36:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-12-03 18:36:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 960. [2018-12-03 18:36:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-03 18:36:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2307 transitions. [2018-12-03 18:36:18,516 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2307 transitions. Word has length 16 [2018-12-03 18:36:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:18,516 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 2307 transitions. [2018-12-03 18:36:18,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2307 transitions. [2018-12-03 18:36:18,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:18,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:18,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:18,517 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:18,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2018-12-03 18:36:18,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:18,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:18,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:18,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:36:18,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 18:36:18,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:18,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:36:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:36:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:36:18,760 INFO L87 Difference]: Start difference. First operand 960 states and 2307 transitions. Second operand 6 states. [2018-12-03 18:36:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:20,541 INFO L93 Difference]: Finished difference Result 1963 states and 4671 transitions. [2018-12-03 18:36:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:36:20,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-03 18:36:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:20,543 INFO L225 Difference]: With dead ends: 1963 [2018-12-03 18:36:20,543 INFO L226 Difference]: Without dead ends: 1004 [2018-12-03 18:36:20,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:36:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-12-03 18:36:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 960. [2018-12-03 18:36:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2018-12-03 18:36:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2180 transitions. [2018-12-03 18:36:21,629 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2180 transitions. Word has length 16 [2018-12-03 18:36:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:21,629 INFO L480 AbstractCegarLoop]: Abstraction has 960 states and 2180 transitions. [2018-12-03 18:36:21,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:36:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2180 transitions. [2018-12-03 18:36:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:21,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:21,630 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:21,630 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:21,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1147109874, now seen corresponding path program 1 times [2018-12-03 18:36:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:21,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:21,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:21,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:21,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:21,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:21,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:21,704 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:21,704 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [199], [203], [207], [236], [245], [254], [264], [274], [349] [2018-12-03 18:36:21,706 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:21,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:21,723 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:21,723 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:36:21,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:21,730 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:21,741 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.53% of their original sizes. [2018-12-03 18:36:21,742 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:21,869 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:21,869 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:21,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:21,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:36:21,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:21,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:36:21,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:36:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:36:21,871 INFO L87 Difference]: Start difference. First operand 960 states and 2180 transitions. Second operand 13 states. [2018-12-03 18:36:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:30,555 INFO L93 Difference]: Finished difference Result 1685 states and 3709 transitions. [2018-12-03 18:36:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:36:30,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:30,560 INFO L225 Difference]: With dead ends: 1685 [2018-12-03 18:36:30,560 INFO L226 Difference]: Without dead ends: 1677 [2018-12-03 18:36:30,561 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 18:36:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2018-12-03 18:36:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1100. [2018-12-03 18:36:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-12-03 18:36:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2497 transitions. [2018-12-03 18:36:32,015 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2497 transitions. Word has length 16 [2018-12-03 18:36:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:32,016 INFO L480 AbstractCegarLoop]: Abstraction has 1100 states and 2497 transitions. [2018-12-03 18:36:32,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2497 transitions. [2018-12-03 18:36:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:32,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:32,017 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:32,017 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:32,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:32,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1762524116, now seen corresponding path program 1 times [2018-12-03 18:36:32,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:32,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:32,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:32,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:32,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:32,097 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:32,097 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [94], [98], [199], [203], [207], [236], [245], [264], [274], [349] [2018-12-03 18:36:32,098 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:32,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:32,113 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:32,114 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:36:32,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:32,117 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:32,126 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.75% of their original sizes. [2018-12-03 18:36:32,126 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:32,226 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:32,226 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:32,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:32,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:36:32,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:32,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:36:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:36:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:36:32,227 INFO L87 Difference]: Start difference. First operand 1100 states and 2497 transitions. Second operand 13 states. [2018-12-03 18:36:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:43,037 INFO L93 Difference]: Finished difference Result 2042 states and 4515 transitions. [2018-12-03 18:36:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:36:43,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:43,041 INFO L225 Difference]: With dead ends: 2042 [2018-12-03 18:36:43,041 INFO L226 Difference]: Without dead ends: 2034 [2018-12-03 18:36:43,042 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=1980, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:36:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2018-12-03 18:36:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1136. [2018-12-03 18:36:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-12-03 18:36:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2577 transitions. [2018-12-03 18:36:44,508 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2577 transitions. Word has length 16 [2018-12-03 18:36:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:44,508 INFO L480 AbstractCegarLoop]: Abstraction has 1136 states and 2577 transitions. [2018-12-03 18:36:44,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2577 transitions. [2018-12-03 18:36:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:44,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:44,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:44,510 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 352691054, now seen corresponding path program 1 times [2018-12-03 18:36:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:44,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:44,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:44,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:44,623 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:44,624 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [199], [203], [207], [236], [245], [264], [274], [292], [349] [2018-12-03 18:36:44,625 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:44,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:44,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:44,642 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:36:44,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:44,649 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:44,658 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.31% of their original sizes. [2018-12-03 18:36:44,658 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:44,766 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:44,766 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:44,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:44,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:36:44,766 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:44,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:36:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:36:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:36:44,767 INFO L87 Difference]: Start difference. First operand 1136 states and 2577 transitions. Second operand 13 states. [2018-12-03 18:36:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:55,708 INFO L93 Difference]: Finished difference Result 1968 states and 4341 transitions. [2018-12-03 18:36:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:36:55,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:36:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:55,711 INFO L225 Difference]: With dead ends: 1968 [2018-12-03 18:36:55,711 INFO L226 Difference]: Without dead ends: 1960 [2018-12-03 18:36:55,713 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:36:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2018-12-03 18:36:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1136. [2018-12-03 18:36:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-12-03 18:36:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 2576 transitions. [2018-12-03 18:36:57,080 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 2576 transitions. Word has length 16 [2018-12-03 18:36:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 1136 states and 2576 transitions. [2018-12-03 18:36:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:36:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 2576 transitions. [2018-12-03 18:36:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:36:57,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:57,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:36:57,081 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:57,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-12-03 18:36:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:57,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:57,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:57,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:57,190 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:36:57,190 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [88], [98], [179], [203], [217], [236], [245], [264], [274], [292], [298], [310], [349] [2018-12-03 18:36:57,191 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:36:57,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:36:57,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:36:57,206 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:36:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:57,208 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:36:57,218 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.55% of their original sizes. [2018-12-03 18:36:57,219 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:36:57,429 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:36:57,429 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:36:57,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:36:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 18:36:57,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:36:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:36:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:36:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:36:57,431 INFO L87 Difference]: Start difference. First operand 1136 states and 2576 transitions. Second operand 15 states. [2018-12-03 18:37:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:07,365 INFO L93 Difference]: Finished difference Result 2167 states and 4830 transitions. [2018-12-03 18:37:07,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:37:07,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:37:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:07,368 INFO L225 Difference]: With dead ends: 2167 [2018-12-03 18:37:07,368 INFO L226 Difference]: Without dead ends: 2153 [2018-12-03 18:37:07,369 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:37:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2018-12-03 18:37:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1374. [2018-12-03 18:37:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-12-03 18:37:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3122 transitions. [2018-12-03 18:37:09,353 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3122 transitions. Word has length 16 [2018-12-03 18:37:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:09,353 INFO L480 AbstractCegarLoop]: Abstraction has 1374 states and 3122 transitions. [2018-12-03 18:37:09,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:37:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3122 transitions. [2018-12-03 18:37:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:37:09,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:09,354 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:09,354 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:09,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-12-03 18:37:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:09,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:10,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:10,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:10,072 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:37:10,072 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [92], [199], [203], [207], [236], [245], [254], [349] [2018-12-03 18:37:10,073 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:10,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:10,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:37:10,088 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:37:10,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:10,090 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:37:10,101 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.37% of their original sizes. [2018-12-03 18:37:10,101 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:37:10,216 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:37:10,216 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:37:10,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:10,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:37:10,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:10,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:37:10,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:37:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:37:10,218 INFO L87 Difference]: Start difference. First operand 1374 states and 3122 transitions. Second operand 13 states. [2018-12-03 18:37:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:20,521 INFO L93 Difference]: Finished difference Result 2031 states and 4490 transitions. [2018-12-03 18:37:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:37:20,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:37:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:20,524 INFO L225 Difference]: With dead ends: 2031 [2018-12-03 18:37:20,524 INFO L226 Difference]: Without dead ends: 2023 [2018-12-03 18:37:20,525 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=454, Invalid=1438, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:37:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-12-03 18:37:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1394. [2018-12-03 18:37:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2018-12-03 18:37:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 3172 transitions. [2018-12-03 18:37:22,407 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 3172 transitions. Word has length 16 [2018-12-03 18:37:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 1394 states and 3172 transitions. [2018-12-03 18:37:22,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:37:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 3172 transitions. [2018-12-03 18:37:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:37:22,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:22,409 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:22,409 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:22,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-12-03 18:37:22,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:22,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:22,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:22,487 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:37:22,487 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [199], [203], [207], [236], [245], [349] [2018-12-03 18:37:22,488 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:22,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:22,503 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:37:22,503 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:37:22,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:22,509 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:37:22,518 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.59% of their original sizes. [2018-12-03 18:37:22,519 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:37:23,107 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:37:23,107 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:37:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:23,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:37:23,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:23,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:37:23,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:37:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:37:23,109 INFO L87 Difference]: Start difference. First operand 1394 states and 3172 transitions. Second operand 13 states. [2018-12-03 18:37:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:34,416 INFO L93 Difference]: Finished difference Result 2297 states and 5103 transitions. [2018-12-03 18:37:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:37:34,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:37:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:34,419 INFO L225 Difference]: With dead ends: 2297 [2018-12-03 18:37:34,419 INFO L226 Difference]: Without dead ends: 2289 [2018-12-03 18:37:34,420 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=571, Invalid=1781, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:37:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2018-12-03 18:37:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1412. [2018-12-03 18:37:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-12-03 18:37:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3209 transitions. [2018-12-03 18:37:36,533 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3209 transitions. Word has length 16 [2018-12-03 18:37:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:36,534 INFO L480 AbstractCegarLoop]: Abstraction has 1412 states and 3209 transitions. [2018-12-03 18:37:36,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:37:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3209 transitions. [2018-12-03 18:37:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:37:36,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:36,535 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:36,535 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:36,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2014581314, now seen corresponding path program 1 times [2018-12-03 18:37:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:36,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:36,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:36,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:36,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:36,634 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:37:36,634 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 18:37:36,635 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:36,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:36,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:37:36,649 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:37:36,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:36,652 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:37:36,661 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.15% of their original sizes. [2018-12-03 18:37:36,661 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:37:36,784 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:37:36,785 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:37:36,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:36,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:37:36,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:36,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:37:36,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:37:36,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:37:36,786 INFO L87 Difference]: Start difference. First operand 1412 states and 3209 transitions. Second operand 13 states. [2018-12-03 18:37:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:49,180 INFO L93 Difference]: Finished difference Result 2364 states and 5238 transitions. [2018-12-03 18:37:49,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:37:49,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:37:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:49,183 INFO L225 Difference]: With dead ends: 2364 [2018-12-03 18:37:49,183 INFO L226 Difference]: Without dead ends: 2356 [2018-12-03 18:37:49,184 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=639, Invalid=2117, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:37:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2018-12-03 18:37:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1348. [2018-12-03 18:37:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-12-03 18:37:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3067 transitions. [2018-12-03 18:37:51,171 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3067 transitions. Word has length 16 [2018-12-03 18:37:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:51,171 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 3067 transitions. [2018-12-03 18:37:51,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:37:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3067 transitions. [2018-12-03 18:37:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:37:51,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:51,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:37:51,173 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:51,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash 714972923, now seen corresponding path program 1 times [2018-12-03 18:37:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:51,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:51,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:51,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:51,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:51,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:37:51,300 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [88], [98], [179], [203], [217], [236], [245], [292], [298], [310], [349] [2018-12-03 18:37:51,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:37:51,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:37:51,320 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:37:51,320 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:37:51,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:51,342 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:37:51,351 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.35% of their original sizes. [2018-12-03 18:37:51,352 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:37:51,556 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:37:51,557 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:37:51,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:37:51,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 18:37:51,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:37:51,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:37:51,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:37:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:37:51,558 INFO L87 Difference]: Start difference. First operand 1348 states and 3067 transitions. Second operand 15 states. [2018-12-03 18:38:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:04,460 INFO L93 Difference]: Finished difference Result 2199 states and 4922 transitions. [2018-12-03 18:38:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:38:04,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:38:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:04,463 INFO L225 Difference]: With dead ends: 2199 [2018-12-03 18:38:04,463 INFO L226 Difference]: Without dead ends: 2185 [2018-12-03 18:38:04,464 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:38:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2018-12-03 18:38:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1350. [2018-12-03 18:38:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2018-12-03 18:38:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3071 transitions. [2018-12-03 18:38:06,422 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 3071 transitions. Word has length 16 [2018-12-03 18:38:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 1350 states and 3071 transitions. [2018-12-03 18:38:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:38:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 3071 transitions. [2018-12-03 18:38:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:06,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:06,423 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:06,424 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:06,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-12-03 18:38:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:06,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:06,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:06,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:06,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:06,525 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:38:06,525 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [98], [199], [203], [207], [236], [245], [292], [349] [2018-12-03 18:38:06,526 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:06,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:06,539 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:06,539 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:38:06,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:06,540 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:06,548 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.15% of their original sizes. [2018-12-03 18:38:06,549 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:06,662 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:38:06,662 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 19 [2018-12-03 18:38:06,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:06,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:38:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:38:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:38:06,663 INFO L87 Difference]: Start difference. First operand 1350 states and 3071 transitions. Second operand 13 states. [2018-12-03 18:38:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:17,865 INFO L93 Difference]: Finished difference Result 1993 states and 4401 transitions. [2018-12-03 18:38:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:38:17,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:38:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:17,868 INFO L225 Difference]: With dead ends: 1993 [2018-12-03 18:38:17,868 INFO L226 Difference]: Without dead ends: 1985 [2018-12-03 18:38:17,869 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:38:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2018-12-03 18:38:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1234. [2018-12-03 18:38:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2018-12-03 18:38:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 2802 transitions. [2018-12-03 18:38:19,757 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 2802 transitions. Word has length 16 [2018-12-03 18:38:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:19,757 INFO L480 AbstractCegarLoop]: Abstraction has 1234 states and 2802 transitions. [2018-12-03 18:38:19,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:38:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 2802 transitions. [2018-12-03 18:38:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:19,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:19,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:19,758 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:19,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash -688951426, now seen corresponding path program 1 times [2018-12-03 18:38:19,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:19,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:19,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:38:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 18:38:20,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:20,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:38:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:38:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:38:20,483 INFO L87 Difference]: Start difference. First operand 1234 states and 2802 transitions. Second operand 9 states. [2018-12-03 18:38:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:25,958 INFO L93 Difference]: Finished difference Result 1719 states and 3818 transitions. [2018-12-03 18:38:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:38:25,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 18:38:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:25,961 INFO L225 Difference]: With dead ends: 1719 [2018-12-03 18:38:25,961 INFO L226 Difference]: Without dead ends: 1711 [2018-12-03 18:38:25,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-12-03 18:38:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2018-12-03 18:38:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1122. [2018-12-03 18:38:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-12-03 18:38:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2537 transitions. [2018-12-03 18:38:27,914 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2537 transitions. Word has length 16 [2018-12-03 18:38:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:27,915 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 2537 transitions. [2018-12-03 18:38:27,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:38:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2537 transitions. [2018-12-03 18:38:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:27,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:27,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:27,916 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:27,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:27,916 INFO L82 PathProgramCache]: Analyzing trace with hash -688849281, now seen corresponding path program 1 times [2018-12-03 18:38:27,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:27,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:38:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 18:38:28,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:38:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:38:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:38:28,311 INFO L87 Difference]: Start difference. First operand 1122 states and 2537 transitions. Second operand 9 states. [2018-12-03 18:38:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:33,015 INFO L93 Difference]: Finished difference Result 1438 states and 3140 transitions. [2018-12-03 18:38:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:38:33,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 18:38:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:33,017 INFO L225 Difference]: With dead ends: 1438 [2018-12-03 18:38:33,017 INFO L226 Difference]: Without dead ends: 1430 [2018-12-03 18:38:33,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:38:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-12-03 18:38:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1112. [2018-12-03 18:38:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-12-03 18:38:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 2512 transitions. [2018-12-03 18:38:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 2512 transitions. Word has length 16 [2018-12-03 18:38:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:34,789 INFO L480 AbstractCegarLoop]: Abstraction has 1112 states and 2512 transitions. [2018-12-03 18:38:34,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:38:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 2512 transitions. [2018-12-03 18:38:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:34,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:34,790 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:34,790 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:34,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:34,791 INFO L82 PathProgramCache]: Analyzing trace with hash -679935045, now seen corresponding path program 1 times [2018-12-03 18:38:34,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:34,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:34,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:34,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:34,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:34,941 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:38:34,942 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [67], [72], [78], [174], [179], [183], [203], [217], [298], [310], [349] [2018-12-03 18:38:34,942 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:34,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:34,952 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:34,952 INFO L272 AbstractInterpreter]: Visited 14 different actions 37 times. Merged at 6 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:38:34,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:34,953 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:34,961 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.35% of their original sizes. [2018-12-03 18:38:34,962 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:35,153 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:38:35,153 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:35,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:35,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 21 [2018-12-03 18:38:35,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:38:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:38:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:38:35,154 INFO L87 Difference]: Start difference. First operand 1112 states and 2512 transitions. Second operand 15 states. [2018-12-03 18:38:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:45,978 INFO L93 Difference]: Finished difference Result 1809 states and 4016 transitions. [2018-12-03 18:38:45,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:38:45,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:38:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:45,980 INFO L225 Difference]: With dead ends: 1809 [2018-12-03 18:38:45,980 INFO L226 Difference]: Without dead ends: 1801 [2018-12-03 18:38:45,981 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=539, Invalid=2011, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:38:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2018-12-03 18:38:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1220. [2018-12-03 18:38:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-12-03 18:38:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 2759 transitions. [2018-12-03 18:38:47,970 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 2759 transitions. Word has length 16 [2018-12-03 18:38:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:47,971 INFO L480 AbstractCegarLoop]: Abstraction has 1220 states and 2759 transitions. [2018-12-03 18:38:47,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:38:47,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2759 transitions. [2018-12-03 18:38:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:47,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:47,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:47,972 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:47,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2131084194, now seen corresponding path program 1 times [2018-12-03 18:38:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:47,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:48,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:38:48,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 18:38:48,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:48,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:38:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:38:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 18:38:48,051 INFO L87 Difference]: Start difference. First operand 1220 states and 2759 transitions. Second operand 9 states. [2018-12-03 18:38:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:53,121 INFO L93 Difference]: Finished difference Result 1532 states and 3371 transitions. [2018-12-03 18:38:53,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:38:53,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 18:38:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:53,124 INFO L225 Difference]: With dead ends: 1532 [2018-12-03 18:38:53,124 INFO L226 Difference]: Without dead ends: 1524 [2018-12-03 18:38:53,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:38:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-12-03 18:38:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1056. [2018-12-03 18:38:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-12-03 18:38:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2390 transitions. [2018-12-03 18:38:54,642 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2390 transitions. Word has length 16 [2018-12-03 18:38:54,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:54,643 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 2390 transitions. [2018-12-03 18:38:54,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:38:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2390 transitions. [2018-12-03 18:38:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:38:54,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:54,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:38:54,644 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:54,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-12-03 18:38:54,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:54,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:54,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:38:54,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:54,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:54,709 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:38:54,709 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [92], [199], [203], [207], [236], [245], [254], [337], [345], [351] [2018-12-03 18:38:54,710 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:38:54,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:38:54,724 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:38:54,725 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:38:54,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:54,730 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:38:54,740 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.48% of their original sizes. [2018-12-03 18:38:54,741 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:38:54,907 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:38:54,907 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:38:54,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:38:54,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 18:38:54,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:38:54,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:38:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:38:54,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:38:54,908 INFO L87 Difference]: Start difference. First operand 1056 states and 2390 transitions. Second operand 13 states. [2018-12-03 18:39:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:04,003 INFO L93 Difference]: Finished difference Result 1687 states and 3698 transitions. [2018-12-03 18:39:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:39:04,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:39:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:04,005 INFO L225 Difference]: With dead ends: 1687 [2018-12-03 18:39:04,005 INFO L226 Difference]: Without dead ends: 1679 [2018-12-03 18:39:04,006 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=927, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:39:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2018-12-03 18:39:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1108. [2018-12-03 18:39:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 18:39:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2517 transitions. [2018-12-03 18:39:05,746 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2517 transitions. Word has length 16 [2018-12-03 18:39:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:05,746 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 2517 transitions. [2018-12-03 18:39:05,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:39:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2517 transitions. [2018-12-03 18:39:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:39:05,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:05,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:39:05,747 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:05,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash -960421593, now seen corresponding path program 1 times [2018-12-03 18:39:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:05,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:05,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:39:05,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:05,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:05,807 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:39:05,807 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [98], [199], [203], [207], [236], [245], [337], [345], [351] [2018-12-03 18:39:05,808 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:05,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:05,822 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:05,823 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:39:05,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:05,826 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:05,834 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.7% of their original sizes. [2018-12-03 18:39:05,835 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:39:05,947 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:39:05,947 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:39:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:39:05,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 18:39:05,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:39:05,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:39:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:39:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:39:05,949 INFO L87 Difference]: Start difference. First operand 1108 states and 2517 transitions. Second operand 13 states. [2018-12-03 18:39:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:15,521 INFO L93 Difference]: Finished difference Result 1912 states and 4185 transitions. [2018-12-03 18:39:15,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:39:15,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:39:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:15,524 INFO L225 Difference]: With dead ends: 1912 [2018-12-03 18:39:15,524 INFO L226 Difference]: Without dead ends: 1904 [2018-12-03 18:39:15,525 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=889, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:39:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-12-03 18:39:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1207. [2018-12-03 18:39:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2018-12-03 18:39:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2748 transitions. [2018-12-03 18:39:17,335 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2748 transitions. Word has length 16 [2018-12-03 18:39:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:17,335 INFO L480 AbstractCegarLoop]: Abstraction has 1207 states and 2748 transitions. [2018-12-03 18:39:17,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:39:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2748 transitions. [2018-12-03 18:39:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:39:17,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:17,336 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:39:17,336 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:17,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-12-03 18:39:17,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:17,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:17,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:39:17,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:17,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:17,432 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:39:17,432 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [102], [186], [192], [203], [227], [229], [236], [337], [345], [351] [2018-12-03 18:39:17,433 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:17,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:17,443 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:17,443 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:39:17,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:17,444 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:17,456 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 51.94% of their original sizes. [2018-12-03 18:39:17,456 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:39:17,661 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:39:17,661 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:39:17,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:39:17,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:39:17,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:39:17,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:39:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:39:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:39:17,663 INFO L87 Difference]: Start difference. First operand 1207 states and 2748 transitions. Second operand 15 states. [2018-12-03 18:39:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:28,543 INFO L93 Difference]: Finished difference Result 2005 states and 4457 transitions. [2018-12-03 18:39:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:39:28,543 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:39:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:28,546 INFO L225 Difference]: With dead ends: 2005 [2018-12-03 18:39:28,546 INFO L226 Difference]: Without dead ends: 1991 [2018-12-03 18:39:28,546 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:39:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-12-03 18:39:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1322. [2018-12-03 18:39:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-03 18:39:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 3000 transitions. [2018-12-03 18:39:30,622 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 3000 transitions. Word has length 16 [2018-12-03 18:39:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:30,622 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 3000 transitions. [2018-12-03 18:39:30,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:39:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 3000 transitions. [2018-12-03 18:39:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:39:30,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:30,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:39:30,623 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:30,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:30,623 INFO L82 PathProgramCache]: Analyzing trace with hash -249130772, now seen corresponding path program 1 times [2018-12-03 18:39:30,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:30,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:39:30,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:30,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:30,681 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:39:30,682 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [98], [199], [203], [207], [236], [245], [292], [337], [345], [351] [2018-12-03 18:39:30,682 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:30,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:30,695 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:30,695 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:39:30,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:30,700 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:30,711 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.26% of their original sizes. [2018-12-03 18:39:30,711 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:39:30,825 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:39:30,825 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:39:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:39:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 18:39:30,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:39:30,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:39:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:39:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:39:30,826 INFO L87 Difference]: Start difference. First operand 1322 states and 3000 transitions. Second operand 13 states. [2018-12-03 18:39:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:41,935 INFO L93 Difference]: Finished difference Result 2253 states and 4962 transitions. [2018-12-03 18:39:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:39:41,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:39:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:41,938 INFO L225 Difference]: With dead ends: 2253 [2018-12-03 18:39:41,938 INFO L226 Difference]: Without dead ends: 2245 [2018-12-03 18:39:41,939 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=878, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:39:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2018-12-03 18:39:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1358. [2018-12-03 18:39:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-12-03 18:39:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 3080 transitions. [2018-12-03 18:39:44,260 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 3080 transitions. Word has length 16 [2018-12-03 18:39:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:44,260 INFO L480 AbstractCegarLoop]: Abstraction has 1358 states and 3080 transitions. [2018-12-03 18:39:44,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:39:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 3080 transitions. [2018-12-03 18:39:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:39:44,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:44,261 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:39:44,261 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:44,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash -336231126, now seen corresponding path program 1 times [2018-12-03 18:39:44,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:44,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:44,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:44,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:39:44,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:44,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:44,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:39:44,324 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [102], [186], [192], [203], [227], [229], [236], [292], [337], [345], [351] [2018-12-03 18:39:44,325 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:44,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:44,336 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:44,336 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:39:44,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:44,339 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:44,350 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 51.57% of their original sizes. [2018-12-03 18:39:44,351 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:39:44,639 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:39:44,639 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:39:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:39:44,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:39:44,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:39:44,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:39:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:39:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:39:44,641 INFO L87 Difference]: Start difference. First operand 1358 states and 3080 transitions. Second operand 15 states. [2018-12-03 18:39:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:57,409 INFO L93 Difference]: Finished difference Result 2181 states and 4833 transitions. [2018-12-03 18:39:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:39:57,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:39:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:57,412 INFO L225 Difference]: With dead ends: 2181 [2018-12-03 18:39:57,412 INFO L226 Difference]: Without dead ends: 2167 [2018-12-03 18:39:57,413 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:39:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-12-03 18:39:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1385. [2018-12-03 18:39:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-12-03 18:39:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 3141 transitions. [2018-12-03 18:39:59,774 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 3141 transitions. Word has length 16 [2018-12-03 18:39:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:59,774 INFO L480 AbstractCegarLoop]: Abstraction has 1385 states and 3141 transitions. [2018-12-03 18:39:59,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:39:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 3141 transitions. [2018-12-03 18:39:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:39:59,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:59,775 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:39:59,776 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:59,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-12-03 18:39:59,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:59,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:59,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:59,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:39:59,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:59,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:59,837 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:39:59,837 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [203], [213], [227], [236], [277], [279], [286], [337], [345], [351] [2018-12-03 18:39:59,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:39:59,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:39:59,850 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:39:59,850 INFO L272 AbstractInterpreter]: Visited 15 different actions 48 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:39:59,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:59,854 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:39:59,863 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 49.28% of their original sizes. [2018-12-03 18:39:59,863 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:00,039 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:40:00,040 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:40:00,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:00,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:40:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:40:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:40:00,041 INFO L87 Difference]: Start difference. First operand 1385 states and 3141 transitions. Second operand 15 states. [2018-12-03 18:40:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:12,227 INFO L93 Difference]: Finished difference Result 2209 states and 4924 transitions. [2018-12-03 18:40:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:40:12,227 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:40:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:12,230 INFO L225 Difference]: With dead ends: 2209 [2018-12-03 18:40:12,230 INFO L226 Difference]: Without dead ends: 2195 [2018-12-03 18:40:12,230 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:40:12,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2018-12-03 18:40:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1370. [2018-12-03 18:40:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-12-03 18:40:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 3106 transitions. [2018-12-03 18:40:14,644 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 3106 transitions. Word has length 16 [2018-12-03 18:40:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:14,644 INFO L480 AbstractCegarLoop]: Abstraction has 1370 states and 3106 transitions. [2018-12-03 18:40:14,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:40:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 3106 transitions. [2018-12-03 18:40:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:40:14,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:14,645 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:40:14,646 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:14,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:14,646 INFO L82 PathProgramCache]: Analyzing trace with hash -755254941, now seen corresponding path program 1 times [2018-12-03 18:40:14,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:14,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:40:14,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:14,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:14,713 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:40:14,713 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [98], [199], [203], [207], [236], [245], [292], [327], [339], [345], [351] [2018-12-03 18:40:14,714 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:14,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:14,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:14,729 INFO L272 AbstractInterpreter]: Visited 14 different actions 39 times. Merged at 4 different actions 20 times. Widened at 4 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:40:14,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:14,737 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:14,744 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 60.78% of their original sizes. [2018-12-03 18:40:14,745 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:14,849 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:40:14,849 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:14,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:14,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 18 [2018-12-03 18:40:14,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:14,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:40:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:40:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:40:14,850 INFO L87 Difference]: Start difference. First operand 1370 states and 3106 transitions. Second operand 13 states. [2018-12-03 18:40:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:25,229 INFO L93 Difference]: Finished difference Result 2107 states and 4640 transitions. [2018-12-03 18:40:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:40:25,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-12-03 18:40:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:25,232 INFO L225 Difference]: With dead ends: 2107 [2018-12-03 18:40:25,232 INFO L226 Difference]: Without dead ends: 2099 [2018-12-03 18:40:25,233 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 18:40:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2018-12-03 18:40:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1322. [2018-12-03 18:40:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-12-03 18:40:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2996 transitions. [2018-12-03 18:40:27,683 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2996 transitions. Word has length 16 [2018-12-03 18:40:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:27,683 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 2996 transitions. [2018-12-03 18:40:27,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:40:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2996 transitions. [2018-12-03 18:40:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:40:27,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:27,684 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:40:27,684 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:27,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -842355295, now seen corresponding path program 1 times [2018-12-03 18:40:27,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:27,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:27,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:27,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:27,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:40:27,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:27,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:27,762 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:40:27,762 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [102], [186], [192], [203], [227], [229], [236], [292], [327], [339], [345], [351] [2018-12-03 18:40:27,762 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:27,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:27,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:27,773 INFO L272 AbstractInterpreter]: Visited 15 different actions 40 times. Merged at 6 different actions 21 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:40:27,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:27,775 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:27,784 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 50.98% of their original sizes. [2018-12-03 18:40:27,784 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:27,955 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:40:27,955 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:27,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:27,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:40:27,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:27,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:40:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:40:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:40:27,956 INFO L87 Difference]: Start difference. First operand 1322 states and 2996 transitions. Second operand 15 states. [2018-12-03 18:40:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:37,118 INFO L93 Difference]: Finished difference Result 2101 states and 4654 transitions. [2018-12-03 18:40:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:40:37,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:40:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:37,121 INFO L225 Difference]: With dead ends: 2101 [2018-12-03 18:40:37,121 INFO L226 Difference]: Without dead ends: 2087 [2018-12-03 18:40:37,122 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:40:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-03 18:40:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1349. [2018-12-03 18:40:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2018-12-03 18:40:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 3057 transitions. [2018-12-03 18:40:39,608 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 3057 transitions. Word has length 16 [2018-12-03 18:40:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:39,608 INFO L480 AbstractCegarLoop]: Abstraction has 1349 states and 3057 transitions. [2018-12-03 18:40:39,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:40:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 3057 transitions. [2018-12-03 18:40:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:40:39,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:39,610 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:40:39,610 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:39,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 627222603, now seen corresponding path program 1 times [2018-12-03 18:40:39,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:39,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:39,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:39,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:40:39,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:39,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:39,673 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:40:39,673 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [203], [213], [227], [236], [277], [279], [286], [327], [339], [345], [351] [2018-12-03 18:40:39,674 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:39,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:39,684 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:39,684 INFO L272 AbstractInterpreter]: Visited 15 different actions 48 times. Merged at 8 different actions 29 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:40:39,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:39,686 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:39,693 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 48.68% of their original sizes. [2018-12-03 18:40:39,693 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:39,855 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:40:39,855 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:39,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:40:39,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:39,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:40:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:40:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:40:39,857 INFO L87 Difference]: Start difference. First operand 1349 states and 3057 transitions. Second operand 15 states. [2018-12-03 18:40:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:51,939 INFO L93 Difference]: Finished difference Result 2365 states and 5260 transitions. [2018-12-03 18:40:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:40:51,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:40:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:51,942 INFO L225 Difference]: With dead ends: 2365 [2018-12-03 18:40:51,942 INFO L226 Difference]: Without dead ends: 2351 [2018-12-03 18:40:51,943 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:40:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2018-12-03 18:40:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1341. [2018-12-03 18:40:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-12-03 18:40:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 3039 transitions. [2018-12-03 18:40:54,390 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 3039 transitions. Word has length 16 [2018-12-03 18:40:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:54,390 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 3039 transitions. [2018-12-03 18:40:54,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:40:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 3039 transitions. [2018-12-03 18:40:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:40:54,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:54,391 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:40:54,391 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:54,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 918935888, now seen corresponding path program 1 times [2018-12-03 18:40:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:54,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:40:54,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:54,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:54,453 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:40:54,453 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [203], [213], [227], [236], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 18:40:54,454 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:40:54,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:40:54,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:40:54,466 INFO L272 AbstractInterpreter]: Visited 15 different actions 52 times. Merged at 9 different actions 33 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:40:54,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:54,471 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:40:54,487 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 45.51% of their original sizes. [2018-12-03 18:40:54,487 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:40:54,949 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:40:54,950 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:40:54,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:40:54,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:40:54,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:40:54,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:40:54,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:40:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:40:54,951 INFO L87 Difference]: Start difference. First operand 1341 states and 3039 transitions. Second operand 15 states. [2018-12-03 18:41:04,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:04,305 INFO L93 Difference]: Finished difference Result 2504 states and 5628 transitions. [2018-12-03 18:41:04,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:41:04,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:41:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:04,308 INFO L225 Difference]: With dead ends: 2504 [2018-12-03 18:41:04,308 INFO L226 Difference]: Without dead ends: 2496 [2018-12-03 18:41:04,308 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:41:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-12-03 18:41:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1890. [2018-12-03 18:41:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2018-12-03 18:41:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 4306 transitions. [2018-12-03 18:41:07,728 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 4306 transitions. Word has length 16 [2018-12-03 18:41:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:07,728 INFO L480 AbstractCegarLoop]: Abstraction has 1890 states and 4306 transitions. [2018-12-03 18:41:07,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:41:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 4306 transitions. [2018-12-03 18:41:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:41:07,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:07,729 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:41:07,729 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:07,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 918936167, now seen corresponding path program 1 times [2018-12-03 18:41:07,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:07,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:07,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:07,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:41:07,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:07,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:07,800 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:41:07,800 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [183], [203], [213], [229], [277], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 18:41:07,801 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:07,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:07,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:41:07,812 INFO L272 AbstractInterpreter]: Visited 15 different actions 51 times. Merged at 9 different actions 32 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:41:07,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:07,813 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:41:07,822 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 45.51% of their original sizes. [2018-12-03 18:41:07,823 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:41:07,961 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:41:07,962 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:41:07,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:41:07,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:41:07,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:41:07,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:41:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:41:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:41:07,963 INFO L87 Difference]: Start difference. First operand 1890 states and 4306 transitions. Second operand 15 states. [2018-12-03 18:41:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:22,128 INFO L93 Difference]: Finished difference Result 3043 states and 6817 transitions. [2018-12-03 18:41:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:41:22,128 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:41:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:22,132 INFO L225 Difference]: With dead ends: 3043 [2018-12-03 18:41:22,132 INFO L226 Difference]: Without dead ends: 3035 [2018-12-03 18:41:22,132 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:41:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2018-12-03 18:41:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 2062. [2018-12-03 18:41:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2018-12-03 18:41:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 4695 transitions. [2018-12-03 18:41:25,936 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 4695 transitions. Word has length 16 [2018-12-03 18:41:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:25,937 INFO L480 AbstractCegarLoop]: Abstraction has 2062 states and 4695 transitions. [2018-12-03 18:41:25,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:41:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 4695 transitions. [2018-12-03 18:41:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:41:25,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:25,937 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:41:25,938 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:25,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 922815724, now seen corresponding path program 1 times [2018-12-03 18:41:25,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:25,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:25,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:25,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:41:26,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:26,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:26,004 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 18:41:26,004 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [174], [183], [203], [279], [283], [317], [321], [323], [331], [339], [345], [351] [2018-12-03 18:41:26,005 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:26,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:26,016 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:41:26,016 INFO L272 AbstractInterpreter]: Visited 15 different actions 49 times. Merged at 9 different actions 30 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:41:26,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:26,023 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:41:26,031 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 44.62% of their original sizes. [2018-12-03 18:41:26,032 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:41:26,205 INFO L418 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-12-03 18:41:26,206 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:41:26,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:41:26,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:41:26,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:41:26,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:41:26,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:41:26,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:41:26,207 INFO L87 Difference]: Start difference. First operand 2062 states and 4695 transitions. Second operand 15 states. [2018-12-03 18:41:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:41,418 INFO L93 Difference]: Finished difference Result 3379 states and 7540 transitions. [2018-12-03 18:41:41,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:41:41,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-12-03 18:41:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:41,422 INFO L225 Difference]: With dead ends: 3379 [2018-12-03 18:41:41,422 INFO L226 Difference]: Without dead ends: 3371 [2018-12-03 18:41:41,423 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:41:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2018-12-03 18:41:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2093. [2018-12-03 18:41:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2018-12-03 18:41:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 4761 transitions. [2018-12-03 18:41:45,334 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 4761 transitions. Word has length 16 [2018-12-03 18:41:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:45,334 INFO L480 AbstractCegarLoop]: Abstraction has 2093 states and 4761 transitions. [2018-12-03 18:41:45,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:41:45,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 4761 transitions. [2018-12-03 18:41:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:41:45,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:45,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:41:45,335 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:45,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1645893604, now seen corresponding path program 1 times [2018-12-03 18:41:45,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:45,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:45,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:41:45,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:45,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:45,468 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:41:45,468 INFO L205 CegarAbsIntRunner]: [0], [4], [76], [84], [94], [98], [102], [186], [192], [229], [240], [337], [345], [351] [2018-12-03 18:41:45,469 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:41:45,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:41:45,482 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:41:45,482 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:41:45,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:45,488 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:41:45,499 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 51.72% of their original sizes. [2018-12-03 18:41:45,500 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:41:46,424 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:41:46,424 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:41:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:41:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:41:46,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:41:46,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:41:46,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:41:46,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:41:46,425 INFO L87 Difference]: Start difference. First operand 2093 states and 4761 transitions. Second operand 15 states. [2018-12-03 18:41:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:57,827 INFO L93 Difference]: Finished difference Result 2571 states and 5807 transitions. [2018-12-03 18:41:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:41:57,827 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:41:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:57,831 INFO L225 Difference]: With dead ends: 2571 [2018-12-03 18:41:57,831 INFO L226 Difference]: Without dead ends: 2563 [2018-12-03 18:41:57,831 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:41:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2018-12-03 18:42:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2117. [2018-12-03 18:42:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 18:42:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 4813 transitions. [2018-12-03 18:42:01,881 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 4813 transitions. Word has length 18 [2018-12-03 18:42:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:01,881 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 4813 transitions. [2018-12-03 18:42:01,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:42:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 4813 transitions. [2018-12-03 18:42:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:42:01,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:01,882 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:01,882 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash -995214687, now seen corresponding path program 1 times [2018-12-03 18:42:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:01,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:01,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:01,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:42:01,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:01,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:01,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:42:01,949 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [78], [98], [102], [186], [192], [229], [240], [292], [337], [345], [351] [2018-12-03 18:42:01,950 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:42:01,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:42:01,961 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:42:01,962 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:42:01,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:01,994 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:42:02,003 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 51.39% of their original sizes. [2018-12-03 18:42:02,003 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:42:02,210 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:42:02,211 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:42:02,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:42:02,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:42:02,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:42:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:42:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:42:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:42:02,212 INFO L87 Difference]: Start difference. First operand 2117 states and 4813 transitions. Second operand 15 states. [2018-12-03 18:42:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:15,664 INFO L93 Difference]: Finished difference Result 2643 states and 5961 transitions. [2018-12-03 18:42:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:42:15,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:42:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:15,667 INFO L225 Difference]: With dead ends: 2643 [2018-12-03 18:42:15,667 INFO L226 Difference]: Without dead ends: 2635 [2018-12-03 18:42:15,668 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:42:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2018-12-03 18:42:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2141. [2018-12-03 18:42:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2018-12-03 18:42:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 4865 transitions. [2018-12-03 18:42:19,745 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 4865 transitions. Word has length 18 [2018-12-03 18:42:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:19,745 INFO L480 AbstractCegarLoop]: Abstraction has 2141 states and 4865 transitions. [2018-12-03 18:42:19,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:42:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 4865 transitions. [2018-12-03 18:42:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:42:19,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:19,746 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:19,747 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:19,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1775095093, now seen corresponding path program 1 times [2018-12-03 18:42:19,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:19,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:19,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:19,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:19,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:42:19,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:19,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:19,810 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:42:19,810 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [78], [98], [186], [192], [213], [229], [240], [277], [279], [286], [337], [345], [351] [2018-12-03 18:42:19,811 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:42:19,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:42:19,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:42:19,826 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 10 different actions 34 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:42:19,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:19,833 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:42:19,842 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 47.99% of their original sizes. [2018-12-03 18:42:19,842 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:42:20,045 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:42:20,045 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:42:20,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:42:20,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:42:20,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:42:20,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:42:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:42:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:42:20,046 INFO L87 Difference]: Start difference. First operand 2141 states and 4865 transitions. Second operand 15 states. [2018-12-03 18:42:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:33,253 INFO L93 Difference]: Finished difference Result 2611 states and 5895 transitions. [2018-12-03 18:42:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:42:33,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:42:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:33,256 INFO L225 Difference]: With dead ends: 2611 [2018-12-03 18:42:33,257 INFO L226 Difference]: Without dead ends: 2603 [2018-12-03 18:42:33,257 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:42:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-12-03 18:42:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2133. [2018-12-03 18:42:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-12-03 18:42:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 4849 transitions. [2018-12-03 18:42:37,376 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 4849 transitions. Word has length 18 [2018-12-03 18:42:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:37,376 INFO L480 AbstractCegarLoop]: Abstraction has 2133 states and 4849 transitions. [2018-12-03 18:42:37,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:42:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 4849 transitions. [2018-12-03 18:42:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:42:37,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:37,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:37,378 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:37,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1921647033, now seen corresponding path program 1 times [2018-12-03 18:42:37,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:37,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:42:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:37,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:37,437 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:42:37,438 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [78], [98], [240], [279], [286], [292], [337], [345], [351] [2018-12-03 18:42:37,438 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:42:37,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:42:37,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:42:37,449 INFO L272 AbstractInterpreter]: Visited 14 different actions 44 times. Merged at 7 different actions 26 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:42:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:37,454 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:42:37,462 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.62% of their original sizes. [2018-12-03 18:42:37,462 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:42:37,649 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:42:37,650 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:42:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:42:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:42:37,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:42:37,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:42:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:42:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:42:37,651 INFO L87 Difference]: Start difference. First operand 2133 states and 4849 transitions. Second operand 15 states. [2018-12-03 18:42:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:53,857 INFO L93 Difference]: Finished difference Result 2974 states and 6716 transitions. [2018-12-03 18:42:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:42:53,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:42:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:53,860 INFO L225 Difference]: With dead ends: 2974 [2018-12-03 18:42:53,860 INFO L226 Difference]: Without dead ends: 2969 [2018-12-03 18:42:53,861 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:42:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2018-12-03 18:42:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2129. [2018-12-03 18:42:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2018-12-03 18:42:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 4839 transitions. [2018-12-03 18:42:57,951 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 4839 transitions. Word has length 18 [2018-12-03 18:42:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:57,951 INFO L480 AbstractCegarLoop]: Abstraction has 2129 states and 4839 transitions. [2018-12-03 18:42:57,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:42:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 4839 transitions. [2018-12-03 18:42:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:42:57,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:57,953 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:42:57,953 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:57,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2049236648, now seen corresponding path program 1 times [2018-12-03 18:42:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:57,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:57,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:42:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:58,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:58,010 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:42:58,010 INFO L205 CegarAbsIntRunner]: [0], [4], [55], [98], [102], [186], [192], [229], [240], [292], [327], [339], [345], [351] [2018-12-03 18:42:58,011 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:42:58,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:42:58,020 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:42:58,020 INFO L272 AbstractInterpreter]: Visited 14 different actions 36 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:42:58,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:58,025 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:42:58,033 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 50.86% of their original sizes. [2018-12-03 18:42:58,034 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:42:58,212 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:42:58,213 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:42:58,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:42:58,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:42:58,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:42:58,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:42:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:42:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:42:58,214 INFO L87 Difference]: Start difference. First operand 2129 states and 4839 transitions. Second operand 15 states. [2018-12-03 18:43:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:09,656 INFO L93 Difference]: Finished difference Result 2616 states and 5903 transitions. [2018-12-03 18:43:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:43:09,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:43:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:09,659 INFO L225 Difference]: With dead ends: 2616 [2018-12-03 18:43:09,659 INFO L226 Difference]: Without dead ends: 2608 [2018-12-03 18:43:09,660 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:43:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-12-03 18:43:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2111. [2018-12-03 18:43:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2018-12-03 18:43:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 4799 transitions. [2018-12-03 18:43:13,699 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 4799 transitions. Word has length 18 [2018-12-03 18:43:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:13,700 INFO L480 AbstractCegarLoop]: Abstraction has 2111 states and 4799 transitions. [2018-12-03 18:43:13,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:43:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 4799 transitions. [2018-12-03 18:43:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:43:13,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:13,701 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:43:13,701 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:13,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1465850242, now seen corresponding path program 1 times [2018-12-03 18:43:13,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:43:13,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:13,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:13,766 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:43:13,766 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [59], [98], [186], [192], [213], [229], [240], [277], [279], [286], [327], [339], [345], [351] [2018-12-03 18:43:13,767 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:43:13,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:43:13,781 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:43:13,781 INFO L272 AbstractInterpreter]: Visited 17 different actions 55 times. Merged at 10 different actions 34 times. Widened at 1 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:43:13,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:13,783 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:43:13,794 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 47.46% of their original sizes. [2018-12-03 18:43:13,794 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:43:13,974 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:43:13,974 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:43:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:43:13,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:43:13,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:43:13,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:43:13,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:43:13,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:43:13,976 INFO L87 Difference]: Start difference. First operand 2111 states and 4799 transitions. Second operand 15 states. [2018-12-03 18:43:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:26,788 INFO L93 Difference]: Finished difference Result 2628 states and 5927 transitions. [2018-12-03 18:43:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:43:26,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:43:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:26,791 INFO L225 Difference]: With dead ends: 2628 [2018-12-03 18:43:26,791 INFO L226 Difference]: Without dead ends: 2620 [2018-12-03 18:43:26,792 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:43:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2018-12-03 18:43:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2101. [2018-12-03 18:43:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2018-12-03 18:43:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4779 transitions. [2018-12-03 18:43:30,804 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4779 transitions. Word has length 18 [2018-12-03 18:43:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:30,804 INFO L480 AbstractCegarLoop]: Abstraction has 2101 states and 4779 transitions. [2018-12-03 18:43:30,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:43:30,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4779 transitions. [2018-12-03 18:43:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:43:30,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:30,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:43:30,805 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:30,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash 867625072, now seen corresponding path program 1 times [2018-12-03 18:43:30,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:30,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:30,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:30,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:30,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:43:30,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:30,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:30,880 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:43:30,880 INFO L205 CegarAbsIntRunner]: [0], [4], [51], [55], [59], [98], [240], [279], [286], [292], [327], [339], [345], [351] [2018-12-03 18:43:30,881 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:43:30,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:43:30,891 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:43:30,891 INFO L272 AbstractInterpreter]: Visited 14 different actions 44 times. Merged at 7 different actions 26 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:43:30,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:30,892 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:43:30,901 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.09% of their original sizes. [2018-12-03 18:43:30,901 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:43:31,075 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:43:31,076 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:43:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:43:31,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:43:31,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:43:31,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:43:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:43:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:43:31,077 INFO L87 Difference]: Start difference. First operand 2101 states and 4779 transitions. Second operand 15 states. [2018-12-03 18:43:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:44,029 INFO L93 Difference]: Finished difference Result 3005 states and 6784 transitions. [2018-12-03 18:43:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:43:44,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:43:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:44,032 INFO L225 Difference]: With dead ends: 3005 [2018-12-03 18:43:44,032 INFO L226 Difference]: Without dead ends: 3000 [2018-12-03 18:43:44,033 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-12-03 18:43:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2018-12-03 18:43:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2087. [2018-12-03 18:43:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2018-12-03 18:43:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 4749 transitions. [2018-12-03 18:43:47,959 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 4749 transitions. Word has length 18 [2018-12-03 18:43:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:47,960 INFO L480 AbstractCegarLoop]: Abstraction has 2087 states and 4749 transitions. [2018-12-03 18:43:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:43:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 4749 transitions. [2018-12-03 18:43:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:43:47,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:47,961 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:43:47,961 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:47,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1762493698, now seen corresponding path program 1 times [2018-12-03 18:43:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:47,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:43:48,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:48,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:48,034 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-03 18:43:48,034 INFO L205 CegarAbsIntRunner]: [0], [4], [45], [55], [98], [240], [292], [317], [323], [327], [331], [339], [345], [351] [2018-12-03 18:43:48,035 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:43:48,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:43:48,045 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:43:48,045 INFO L272 AbstractInterpreter]: Visited 14 different actions 48 times. Merged at 8 different actions 30 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:43:48,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:48,051 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:43:48,060 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 40.49% of their original sizes. [2018-12-03 18:43:48,060 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:43:48,208 INFO L418 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2018-12-03 18:43:48,209 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:43:48,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:43:48,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 20 [2018-12-03 18:43:48,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:43:48,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:43:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:43:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:43:48,210 INFO L87 Difference]: Start difference. First operand 2087 states and 4749 transitions. Second operand 15 states. [2018-12-03 18:44:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:44:03,092 INFO L93 Difference]: Finished difference Result 3761 states and 8476 transitions. [2018-12-03 18:44:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:44:03,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-12-03 18:44:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:44:03,097 INFO L225 Difference]: With dead ends: 3761 [2018-12-03 18:44:03,097 INFO L226 Difference]: Without dead ends: 3753 [2018-12-03 18:44:03,097 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=1220, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:44:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2018-12-03 18:44:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 1897. [2018-12-03 18:44:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2018-12-03 18:44:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4324 transitions. [2018-12-03 18:44:07,381 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4324 transitions. Word has length 18 [2018-12-03 18:44:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:44:07,381 INFO L480 AbstractCegarLoop]: Abstraction has 1897 states and 4324 transitions. [2018-12-03 18:44:07,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:44:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4324 transitions. [2018-12-03 18:44:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:44:07,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:44:07,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:44:07,383 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:44:07,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 520693007, now seen corresponding path program 1 times [2018-12-03 18:44:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:44:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:07,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:44:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:07,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:07,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:44:07,697 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:44:07,698 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [260], [274], [349] [2018-12-03 18:44:07,698 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:44:07,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:44:07,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:44:07,728 INFO L272 AbstractInterpreter]: Visited 16 different actions 93 times. Merged at 10 different actions 63 times. Widened at 7 different actions 26 times. Found 14 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:44:07,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:07,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:44:07,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:07,735 INFO L192 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 [2018-12-03 18:44:07,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:07,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:44:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:07,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:44:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:44:08,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:44:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:44:09,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:44:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2018-12-03 18:44:09,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:44:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:44:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:44:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:44:09,001 INFO L87 Difference]: Start difference. First operand 1897 states and 4324 transitions. Second operand 14 states. [2018-12-03 18:44:10,490 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-03 18:44:17,152 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 18:44:19,158 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 18:44:23,051 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:44:26,409 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-03 18:44:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:44:30,218 INFO L93 Difference]: Finished difference Result 4818 states and 10773 transitions. [2018-12-03 18:44:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:44:30,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 18:44:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:44:30,224 INFO L225 Difference]: With dead ends: 4818 [2018-12-03 18:44:30,224 INFO L226 Difference]: Without dead ends: 4810 [2018-12-03 18:44:30,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=730, Invalid=2240, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:44:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-12-03 18:44:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 2909. [2018-12-03 18:44:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2018-12-03 18:44:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 6732 transitions. [2018-12-03 18:44:36,814 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 6732 transitions. Word has length 20 [2018-12-03 18:44:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:44:36,814 INFO L480 AbstractCegarLoop]: Abstraction has 2909 states and 6732 transitions. [2018-12-03 18:44:36,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:44:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 6732 transitions. [2018-12-03 18:44:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:44:36,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:44:36,816 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:44:36,817 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:44:36,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 759878049, now seen corresponding path program 1 times [2018-12-03 18:44:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:44:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:36,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:44:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:36,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:36,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:44:36,938 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:44:36,939 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [122], [199], [203], [207], [224], [236], [245], [247], [254], [264], [274], [349] [2018-12-03 18:44:36,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:44:36,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:44:36,985 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:44:36,985 INFO L272 AbstractInterpreter]: Visited 17 different actions 90 times. Merged at 9 different actions 59 times. Widened at 7 different actions 27 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:44:36,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:36,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:44:36,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:36,997 INFO L192 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 [2018-12-03 18:44:37,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:37,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:44:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:37,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:44:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:44:37,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:44:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:44:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:44:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 18:44:37,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:44:37,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:44:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:44:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:44:37,383 INFO L87 Difference]: Start difference. First operand 2909 states and 6732 transitions. Second operand 15 states. [2018-12-03 18:45:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:03,731 INFO L93 Difference]: Finished difference Result 6811 states and 15250 transitions. [2018-12-03 18:45:03,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:45:03,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-12-03 18:45:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:03,738 INFO L225 Difference]: With dead ends: 6811 [2018-12-03 18:45:03,738 INFO L226 Difference]: Without dead ends: 6803 [2018-12-03 18:45:03,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1488, Invalid=5994, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 18:45:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2018-12-03 18:45:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 3270. [2018-12-03 18:45:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-03 18:45:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 7527 transitions. [2018-12-03 18:45:12,095 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 7527 transitions. Word has length 20 [2018-12-03 18:45:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:12,095 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 7527 transitions. [2018-12-03 18:45:12,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:45:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 7527 transitions. [2018-12-03 18:45:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:45:12,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:12,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:45:12,097 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:12,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:12,097 INFO L82 PathProgramCache]: Analyzing trace with hash 751079347, now seen corresponding path program 1 times [2018-12-03 18:45:12,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:12,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:12,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:12,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:12,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:12,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:12,198 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:45:12,198 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [92], [94], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [254], [264], [274], [349] [2018-12-03 18:45:12,199 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:45:12,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:45:12,240 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:45:12,240 INFO L272 AbstractInterpreter]: Visited 20 different actions 113 times. Merged at 12 different actions 78 times. Widened at 10 different actions 31 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:45:12,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:12,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:45:12,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:12,243 INFO L192 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 [2018-12-03 18:45:12,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:12,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:45:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:12,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:45:12,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:45:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:12,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 18:45:12,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:12,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:45:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:45:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:45:12,478 INFO L87 Difference]: Start difference. First operand 3270 states and 7527 transitions. Second operand 14 states. [2018-12-03 18:45:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:35,842 INFO L93 Difference]: Finished difference Result 6144 states and 13831 transitions. [2018-12-03 18:45:35,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:45:35,843 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 18:45:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:35,849 INFO L225 Difference]: With dead ends: 6144 [2018-12-03 18:45:35,850 INFO L226 Difference]: Without dead ends: 6136 [2018-12-03 18:45:35,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=917, Invalid=4195, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:45:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-12-03 18:45:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 3597. [2018-12-03 18:45:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-03 18:45:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 8266 transitions. [2018-12-03 18:45:44,792 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 8266 transitions. Word has length 20 [2018-12-03 18:45:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:44,793 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 8266 transitions. [2018-12-03 18:45:44,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:45:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 8266 transitions. [2018-12-03 18:45:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:45:44,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:44,794 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:45:44,794 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:44,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 748278993, now seen corresponding path program 1 times [2018-12-03 18:45:44,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:44,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:44,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:44,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:44,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:44,884 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:45:44,884 INFO L205 CegarAbsIntRunner]: [0], [4], [65], [84], [94], [98], [102], [104], [110], [115], [186], [192], [203], [229], [236], [245], [264], [274], [349] [2018-12-03 18:45:44,885 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:45:44,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:45:44,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:45:44,924 INFO L272 AbstractInterpreter]: Visited 19 different actions 119 times. Merged at 12 different actions 84 times. Widened at 9 different actions 37 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 18:45:44,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:44,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:45:44,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:44,930 INFO L192 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 [2018-12-03 18:45:44,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:44,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:45:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:44,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:45:45,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:45:45,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:45,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 18:45:45,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:45,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:45:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:45:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:45:45,229 INFO L87 Difference]: Start difference. First operand 3597 states and 8266 transitions. Second operand 14 states. [2018-12-03 18:46:08,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:08,434 INFO L93 Difference]: Finished difference Result 6177 states and 13913 transitions. [2018-12-03 18:46:08,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:46:08,435 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-12-03 18:46:08,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:08,441 INFO L225 Difference]: With dead ends: 6177 [2018-12-03 18:46:08,442 INFO L226 Difference]: Without dead ends: 6169 [2018-12-03 18:46:08,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=819, Invalid=3603, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:46:08,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2018-12-03 18:46:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 3534. [2018-12-03 18:46:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3534 states. [2018-12-03 18:46:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 3534 states and 8177 transitions. [2018-12-03 18:46:17,530 INFO L78 Accepts]: Start accepts. Automaton has 3534 states and 8177 transitions. Word has length 20 [2018-12-03 18:46:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:46:17,530 INFO L480 AbstractCegarLoop]: Abstraction has 3534 states and 8177 transitions. [2018-12-03 18:46:17,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:46:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3534 states and 8177 transitions. [2018-12-03 18:46:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:46:17,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:46:17,532 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:46:17,532 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:46:17,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 19446543, now seen corresponding path program 1 times [2018-12-03 18:46:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:46:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:17,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:46:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:17,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:46:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:17,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:17,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:46:17,728 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:46:17,728 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [98], [122], [199], [203], [207], [224], [236], [245], [247], [254], [349] [2018-12-03 18:46:17,729 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:46:17,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:46:17,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:46:17,758 INFO L272 AbstractInterpreter]: Visited 18 different actions 91 times. Merged at 9 different actions 59 times. Widened at 7 different actions 26 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:46:17,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:17,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:46:17,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:17,762 INFO L192 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 [2018-12-03 18:46:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:46:17,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:46:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:17,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:46:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:46:17,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:46:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:46:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:46:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 18:46:18,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:46:18,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:46:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:46:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:46:18,209 INFO L87 Difference]: Start difference. First operand 3534 states and 8177 transitions. Second operand 15 states. [2018-12-03 18:46:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:52,333 INFO L93 Difference]: Finished difference Result 7912 states and 17877 transitions. [2018-12-03 18:46:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 18:46:52,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-12-03 18:46:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:52,343 INFO L225 Difference]: With dead ends: 7912 [2018-12-03 18:46:52,343 INFO L226 Difference]: Without dead ends: 7904 [2018-12-03 18:46:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1837, Invalid=6905, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:46:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2018-12-03 18:47:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 3506. [2018-12-03 18:47:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-12-03 18:47:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 8161 transitions. [2018-12-03 18:47:01,515 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 8161 transitions. Word has length 20 [2018-12-03 18:47:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:01,515 INFO L480 AbstractCegarLoop]: Abstraction has 3506 states and 8161 transitions. [2018-12-03 18:47:01,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:47:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 8161 transitions. [2018-12-03 18:47:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:47:01,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:01,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:47:01,517 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr13ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:01,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash -743176670, now seen corresponding path program 1 times [2018-12-03 18:47:01,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:01,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:01,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:01,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:01,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 18:47:01,723 INFO L205 CegarAbsIntRunner]: [0], [4], [67], [72], [76], [84], [94], [102], [104], [110], [115], [183], [186], [192], [203], [229], [349] [2018-12-03 18:47:01,724 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:01,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:01,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:47:01,756 INFO L272 AbstractInterpreter]: Visited 17 different actions 97 times. Merged at 10 different actions 66 times. Widened at 7 different actions 29 times. Found 14 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 18:47:01,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:01,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:47:01,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:01,759 INFO L192 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 [2018-12-03 18:47:01,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:01,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:01,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:47:01,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 18:47:02,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2018-12-03 18:47:02,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:02,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:47:02,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:47:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:47:02,023 INFO L87 Difference]: Start difference. First operand 3506 states and 8161 transitions. Second operand 14 states.