java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:19:54,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:19:54,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:19:54,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:19:54,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:19:54,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:19:54,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:19:54,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:19:54,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:19:54,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:19:54,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:19:54,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:19:54,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:19:54,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:19:54,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:19:54,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:19:54,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:19:54,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:19:54,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:19:54,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:19:54,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:19:54,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:19:54,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:19:54,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:19:54,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:19:54,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:19:54,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:19:54,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:19:54,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:19:54,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:19:54,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:19:54,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:19:54,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:19:54,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:19:54,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:19:54,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:19:54,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:19:54,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:19:54,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:19:54,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:19:54,701 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:19:54,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:19:54,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:19:54,702 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:19:54,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:19:54,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:19:54,704 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:19:54,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:19:54,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:19:54,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:19:54,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:19:54,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:19:54,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:19:54,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:19:54,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:19:54,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:19:54,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:19:54,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:19:54,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:19:54,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:19:54,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:19:54,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:19:54,709 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:19:54,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:19:54,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:19:54,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:19:54,809 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:19:54,810 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:19:54,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-10-04 14:19:54,811 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-04 14:19:54,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:19:54,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:19:54,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:54,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:19:54,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:19:54,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,907 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:19:54,908 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:19:54,908 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:19:54,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:19:54,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:19:54,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:19:54,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:19:54,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/1) ... [2018-10-04 14:19:54,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:19:54,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:19:54,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:19:54,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:19:54,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (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-10-04 14:19:54,997 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 14:19:54,997 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 14:19:54,997 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 14:19:55,488 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:19:55,489 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:55 BoogieIcfgContainer [2018-10-04 14:19:55,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:19:55,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:19:55,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:19:55,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:19:55,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:19:54" (1/2) ... [2018-10-04 14:19:55,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548bead8 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:19:55, skipping insertion in model container [2018-10-04 14:19:55,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:19:55" (2/2) ... [2018-10-04 14:19:55,497 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-04 14:19:55,507 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:19:55,516 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 14:19:55,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:19:55,559 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:19:55,559 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:19:55,559 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:19:55,559 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:19:55,560 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:19:55,560 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:19:55,560 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:19:55,560 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:19:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 14:19:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:55,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:55,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:55,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:55,590 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:55,590 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-04 14:19:55,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:55,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:55,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:55,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:55,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:55,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:55,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:55,825 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-04 14:19:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:56,468 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-04 14:19:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:19:56,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:56,485 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:19:56,486 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 14:19:56,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 14:19:56,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 14:19:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 14:19:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:19:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-04 14:19:56,534 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-04 14:19:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:56,534 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-04 14:19:56,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-04 14:19:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:19:56,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:56,535 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:19:56,536 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:56,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:56,536 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-04 14:19:56,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:56,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:56,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:56,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:56,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:19:56,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:19:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:19:56,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:56,609 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-04 14:19:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:56,923 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-04 14:19:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:19:56,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:19:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:56,925 INFO L225 Difference]: With dead ends: 57 [2018-10-04 14:19:56,925 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 14:19:56,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:19:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 14:19:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-04 14:19:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:19:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-04 14:19:56,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-04 14:19:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:56,937 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-04 14:19:56,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:19:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-04 14:19:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:56,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:56,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:56,939 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:56,939 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-04 14:19:56,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:56,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:57,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:19:57,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 14:19:57,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:19:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:19:57,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:57,152 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-04 14:19:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:58,439 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-04 14:19:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:19:58,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 14:19:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:58,446 INFO L225 Difference]: With dead ends: 84 [2018-10-04 14:19:58,446 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 14:19:58,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 8 [2018-10-04 14:19:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 14:19:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-04 14:19:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:19:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-04 14:19:58,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-04 14:19:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:58,473 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-04 14:19:58,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:19:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-04 14:19:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:19:58,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:58,475 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 14:19:58,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:58,475 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-04 14:19:58,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:58,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:58,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:58,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:58,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:58,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:58,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:58,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:19:58,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 14:19:58,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:19:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:19:58,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:58,763 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-04 14:19:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:19:59,752 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-04 14:19:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:19:59,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-04 14:19:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:19:59,757 INFO L225 Difference]: With dead ends: 142 [2018-10-04 14:19:59,757 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 14:19:59,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 15 [2018-10-04 14:19:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 14:19:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-04 14:19:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 14:19:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-04 14:19:59,775 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-04 14:19:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:19:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-04 14:19:59,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:19:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-04 14:19:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:19:59,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:19:59,777 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:19:59,777 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:19:59,777 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:19:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-04 14:19:59,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:19:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:19:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:19:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:59,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:19:59,910 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:19:59,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:19:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:19:59,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:19:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:19:59,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:19:59,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-04 14:19:59,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:19:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:19:59,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:19:59,990 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-04 14:20:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:01,084 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-04 14:20:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:01,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-04 14:20:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:01,086 INFO L225 Difference]: With dead ends: 148 [2018-10-04 14:20:01,086 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 14:20:01,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 17 [2018-10-04 14:20:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 14:20:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-04 14:20:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 14:20:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-04 14:20:01,105 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-04 14:20:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:01,105 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-04 14:20:01,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-04 14:20:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:01,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:01,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:01,107 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:01,107 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-04 14:20:01,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:01,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:01,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:01,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:01,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:01,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:01,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:01,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:01,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:01,360 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-04 14:20:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:02,364 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-04 14:20:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:02,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:02,365 INFO L225 Difference]: With dead ends: 124 [2018-10-04 14:20:02,365 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 14:20:02,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 14 [2018-10-04 14:20:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 14:20:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-04 14:20:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 14:20:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-04 14:20:02,392 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-04 14:20:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:02,393 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-04 14:20:02,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-04 14:20:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:02,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:02,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:02,395 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:02,395 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-04 14:20:02,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:02,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:02,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:02,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:02,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:02,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:02,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:02,522 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:02,523 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-04 14:20:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:03,077 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-04 14:20:03,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:03,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 14:20:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:03,079 INFO L225 Difference]: With dead ends: 132 [2018-10-04 14:20:03,079 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 14:20:03,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 13 [2018-10-04 14:20:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 14:20:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-04 14:20:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 14:20:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-04 14:20:03,104 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-04 14:20:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:03,104 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-04 14:20:03,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-04 14:20:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:03,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:03,106 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:03,106 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:03,107 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-04 14:20:03,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:03,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:03,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:03,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:03,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:03,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 14:20:03,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:03,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:03,743 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-04 14:20:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:06,659 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-04 14:20:06,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:06,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:06,662 INFO L225 Difference]: With dead ends: 162 [2018-10-04 14:20:06,662 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 14:20:06,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 16 [2018-10-04 14:20:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 14:20:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-04 14:20:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 14:20:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-04 14:20:06,687 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-04 14:20:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:06,687 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-04 14:20:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-04 14:20:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:06,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:06,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:06,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:06,689 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-04 14:20:06,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:06,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:06,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:06,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:06,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:07,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 14:20:07,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:07,091 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:07,091 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-04 14:20:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:08,862 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-04 14:20:08,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:20:08,862 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 14:20:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:08,865 INFO L225 Difference]: With dead ends: 223 [2018-10-04 14:20:08,865 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 14:20:08,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 31 [2018-10-04 14:20:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 14:20:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-04 14:20:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 14:20:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-04 14:20:08,897 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-04 14:20:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:08,897 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-04 14:20:08,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-04 14:20:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:08,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:08,898 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:08,899 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:08,899 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-04 14:20:08,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:08,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:08,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:08,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:08,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:09,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:09,002 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:09,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:09,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:09,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:09,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:09,184 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-04 14:20:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:10,195 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-04 14:20:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:20:10,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:10,197 INFO L225 Difference]: With dead ends: 222 [2018-10-04 14:20:10,197 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 14:20:10,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 14:20:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 14:20:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-04 14:20:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 14:20:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-04 14:20:10,226 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-04 14:20:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:10,226 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-04 14:20:10,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-04 14:20:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:10,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:10,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:10,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:10,228 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-04 14:20:10,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:10,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,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-10-04 14:20:10,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:10,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:10,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:10,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:10,305 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-04 14:20:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:10,618 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-04 14:20:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:20:10,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 14:20:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:10,622 INFO L225 Difference]: With dead ends: 203 [2018-10-04 14:20:10,623 INFO L226 Difference]: Without dead ends: 201 [2018-10-04 14:20:10,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 14:20:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-04 14:20:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-04 14:20:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 14:20:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-04 14:20:10,650 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-04 14:20:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-04 14:20:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-04 14:20:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:10,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:10,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:10,652 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:10,652 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-04 14:20:10,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:10,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:10,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:10,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:10,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:10,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:10,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:10,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:10,944 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-04 14:20:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:11,597 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-04 14:20:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:20:11,598 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:11,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:11,599 INFO L225 Difference]: With dead ends: 241 [2018-10-04 14:20:11,600 INFO L226 Difference]: Without dead ends: 240 [2018-10-04 14:20:11,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 14 [2018-10-04 14:20:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-04 14:20:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-04 14:20:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 14:20:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-04 14:20:11,631 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-04 14:20:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:11,631 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-04 14:20:11,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-04 14:20:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:11,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:11,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:11,633 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:11,633 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-04 14:20:11,633 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:11,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:11,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:11,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:11,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:11,724 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-04 14:20:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:12,180 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-04 14:20:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:20:12,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 14:20:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:12,183 INFO L225 Difference]: With dead ends: 220 [2018-10-04 14:20:12,183 INFO L226 Difference]: Without dead ends: 218 [2018-10-04 14:20:12,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 14:20:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-04 14:20:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-04 14:20:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 14:20:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-04 14:20:12,218 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-04 14:20:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:12,219 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-04 14:20:12,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-04 14:20:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:12,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:12,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:12,220 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:12,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-04 14:20:12,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:12,411 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:12,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:12,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:12,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 14:20:12,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:12,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:12,521 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-04 14:20:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:13,750 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-04 14:20:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:20:13,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 14:20:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:13,753 INFO L225 Difference]: With dead ends: 320 [2018-10-04 14:20:13,753 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 14:20:13,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 31 [2018-10-04 14:20:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 14:20:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-04 14:20:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 14:20:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-04 14:20:13,791 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-04 14:20:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:13,791 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-04 14:20:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-04 14:20:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:13,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:13,792 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:13,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:13,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-04 14:20:13,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:13,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:13,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:13,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:13,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:13,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:14,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:14,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 14:20:14,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:14,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:14,046 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-04 14:20:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:14,525 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-04 14:20:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:20:14,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:14,527 INFO L225 Difference]: With dead ends: 304 [2018-10-04 14:20:14,527 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 14:20:14,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 14:20:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 14:20:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-04 14:20:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 14:20:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-04 14:20:14,571 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-04 14:20:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:14,571 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-04 14:20:14,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-04 14:20:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:14,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:14,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:14,572 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:14,572 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-04 14:20:14,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:14,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:14,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:14,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:14,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:14,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:14,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 14:20:14,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:14,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:14,809 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-04 14:20:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:15,304 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-04 14:20:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:15,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 14:20:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:15,306 INFO L225 Difference]: With dead ends: 281 [2018-10-04 14:20:15,306 INFO L226 Difference]: Without dead ends: 280 [2018-10-04 14:20:15,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-04 14:20:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-04 14:20:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-04 14:20:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 14:20:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-04 14:20:15,349 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-04 14:20:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:15,349 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-04 14:20:15,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-04 14:20:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:20:15,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:15,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:15,350 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:15,350 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-04 14:20:15,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:15,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:20:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 14:20:15,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:20:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:20:15,425 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:15,425 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-04 14:20:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:15,804 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-04 14:20:15,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:20:15,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 14:20:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:15,807 INFO L225 Difference]: With dead ends: 286 [2018-10-04 14:20:15,807 INFO L226 Difference]: Without dead ends: 284 [2018-10-04 14:20:15,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 14:20:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-04 14:20:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-04 14:20:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 14:20:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-04 14:20:15,855 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-04 14:20:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:15,856 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-04 14:20:15,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:20:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-04 14:20:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:15,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:15,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:15,857 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:15,858 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:15,858 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-04 14:20:15,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:15,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:15,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:15,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:16,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:16,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:16,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:17,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 14:20:17,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:17,120 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:17,120 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-04 14:20:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:18,700 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-04 14:20:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:20:18,701 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 14:20:18,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:18,703 INFO L225 Difference]: With dead ends: 515 [2018-10-04 14:20:18,703 INFO L226 Difference]: Without dead ends: 513 [2018-10-04 14:20:18,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 35 [2018-10-04 14:20:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-04 14:20:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-04 14:20:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-04 14:20:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-04 14:20:18,771 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-04 14:20:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:18,771 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-04 14:20:18,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-04 14:20:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:20:18,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:18,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:18,773 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:18,773 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-04 14:20:18,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:18,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:18,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:18,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:18,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:19,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:19,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 14:20:19,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:19,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:19,066 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-04 14:20:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:20,455 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-04 14:20:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:20:20,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 14:20:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:20,459 INFO L225 Difference]: With dead ends: 631 [2018-10-04 14:20:20,460 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 14:20:20,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 32 [2018-10-04 14:20:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 14:20:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-04 14:20:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 14:20:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-04 14:20:20,559 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-04 14:20:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:20,560 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-04 14:20:20,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-04 14:20:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:20,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:20,561 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:20,561 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:20,561 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-04 14:20:20,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:20,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:20,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:20,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:20,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:20,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 14:20:20,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:20,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:20,886 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-04 14:20:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:22,671 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-04 14:20:22,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:20:22,671 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:22,675 INFO L225 Difference]: With dead ends: 1330 [2018-10-04 14:20:22,675 INFO L226 Difference]: Without dead ends: 929 [2018-10-04 14:20:22,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 27 [2018-10-04 14:20:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-04 14:20:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-04 14:20:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-04 14:20:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-04 14:20:22,835 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-04 14:20:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-04 14:20:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-04 14:20:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:22,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:22,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:22,837 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:22,837 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-04 14:20:22,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:22,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:22,926 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:22,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:23,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:23,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 14:20:23,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:23,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:23,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:23,346 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-04 14:20:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:24,908 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-10-04 14:20:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:24,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:24,912 INFO L225 Difference]: With dead ends: 1557 [2018-10-04 14:20:24,912 INFO L226 Difference]: Without dead ends: 864 [2018-10-04 14:20:24,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 23 [2018-10-04 14:20:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-04 14:20:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-10-04 14:20:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 14:20:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-10-04 14:20:25,063 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-10-04 14:20:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:25,063 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-10-04 14:20:25,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-10-04 14:20:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:25,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:25,065 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:25,065 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:25,065 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-10-04 14:20:25,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:25,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:25,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:25,171 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:25,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:25,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:25,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 14:20:25,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:25,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:25,301 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-10-04 14:20:26,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:26,303 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-10-04 14:20:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:26,305 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 14:20:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:26,309 INFO L225 Difference]: With dead ends: 1655 [2018-10-04 14:20:26,309 INFO L226 Difference]: Without dead ends: 915 [2018-10-04 14:20:26,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 22 [2018-10-04 14:20:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-04 14:20:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-10-04 14:20:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-04 14:20:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-10-04 14:20:26,463 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-10-04 14:20:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:26,464 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-10-04 14:20:26,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-10-04 14:20:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:26,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:26,465 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:26,465 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:26,465 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-10-04 14:20:26,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:26,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:26,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:26,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:26,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:26,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:26,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 14:20:26,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:26,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:26,644 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:26,644 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-10-04 14:20:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:27,323 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-10-04 14:20:27,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:27,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 14:20:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:27,327 INFO L225 Difference]: With dead ends: 939 [2018-10-04 14:20:27,327 INFO L226 Difference]: Without dead ends: 937 [2018-10-04 14:20:27,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 14:20:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-04 14:20:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-10-04 14:20:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-04 14:20:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-10-04 14:20:27,468 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-10-04 14:20:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:27,468 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-10-04 14:20:27,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-10-04 14:20:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:27,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:27,469 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:27,469 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:27,469 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-10-04 14:20:27,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:27,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:27,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:27,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:27,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:27,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:27,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 14:20:27,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:27,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:27,841 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-10-04 14:20:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:29,774 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-10-04 14:20:29,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:20:29,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:29,779 INFO L225 Difference]: With dead ends: 2058 [2018-10-04 14:20:29,780 INFO L226 Difference]: Without dead ends: 1239 [2018-10-04 14:20:29,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 26 [2018-10-04 14:20:29,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-10-04 14:20:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-10-04 14:20:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-04 14:20:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-10-04 14:20:30,039 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-10-04 14:20:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:30,039 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-10-04 14:20:30,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-10-04 14:20:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:30,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:30,040 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:30,041 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:30,041 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-10-04 14:20:30,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:30,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:30,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:30,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:30,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:30,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:30,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:30,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 14:20:31,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:20:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:20:31,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:31,401 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-10-04 14:20:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:32,170 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-10-04 14:20:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:20:32,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 14:20:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:32,174 INFO L225 Difference]: With dead ends: 1038 [2018-10-04 14:20:32,174 INFO L226 Difference]: Without dead ends: 1036 [2018-10-04 14:20:32,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.8s impTime 13 [2018-10-04 14:20:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-10-04 14:20:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-10-04 14:20:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-04 14:20:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-10-04 14:20:32,342 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-10-04 14:20:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:32,343 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-10-04 14:20:32,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:20:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-10-04 14:20:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:32,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:32,344 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:32,344 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:32,344 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:32,344 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-10-04 14:20:32,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:32,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:32,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 14:20:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:32,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:32,564 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-10-04 14:20:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:34,314 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-10-04 14:20:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:20:34,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:34,319 INFO L225 Difference]: With dead ends: 2193 [2018-10-04 14:20:34,319 INFO L226 Difference]: Without dead ends: 1286 [2018-10-04 14:20:34,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.6s impTime 25 [2018-10-04 14:20:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-04 14:20:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-10-04 14:20:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-04 14:20:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-10-04 14:20:34,512 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-10-04 14:20:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:34,512 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-10-04 14:20:34,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-10-04 14:20:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:34,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:34,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:34,513 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:34,513 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-10-04 14:20:34,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:34,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:34,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:34,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:34,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:34,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 14:20:34,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:34,890 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:34,890 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-10-04 14:20:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:36,051 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-10-04 14:20:36,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:36,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:36,055 INFO L225 Difference]: With dead ends: 2165 [2018-10-04 14:20:36,055 INFO L226 Difference]: Without dead ends: 1153 [2018-10-04 14:20:36,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 23 [2018-10-04 14:20:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-04 14:20:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-10-04 14:20:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-04 14:20:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-10-04 14:20:36,247 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-10-04 14:20:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:36,247 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-10-04 14:20:36,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-10-04 14:20:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:36,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:36,248 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:36,249 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:36,249 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-10-04 14:20:36,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:36,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:36,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:36,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:36,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:36,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:36,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 14:20:36,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:36,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:36,493 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:36,493 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-10-04 14:20:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:37,535 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-10-04 14:20:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:37,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 14:20:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:37,539 INFO L225 Difference]: With dead ends: 1397 [2018-10-04 14:20:37,539 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 14:20:37,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 22 [2018-10-04 14:20:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 14:20:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-10-04 14:20:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-04 14:20:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-10-04 14:20:37,735 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-10-04 14:20:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:37,735 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-10-04 14:20:37,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-10-04 14:20:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:20:37,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:37,736 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:37,736 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:37,736 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-10-04 14:20:37,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:37,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:37,838 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:37,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:37,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:37,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 14:20:37,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:37,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:37,954 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-10-04 14:20:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:40,857 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-10-04 14:20:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:20:40,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 14:20:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:40,863 INFO L225 Difference]: With dead ends: 2724 [2018-10-04 14:20:40,863 INFO L226 Difference]: Without dead ends: 1719 [2018-10-04 14:20:40,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 29 [2018-10-04 14:20:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-10-04 14:20:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-10-04 14:20:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-04 14:20:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-10-04 14:20:41,125 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-10-04 14:20:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:41,125 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-10-04 14:20:41,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-10-04 14:20:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:41,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:41,126 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:41,126 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:41,126 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-10-04 14:20:41,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:41,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:41,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:41,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:41,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:41,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2018-10-04 14:20:41,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:20:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:20:41,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:41,406 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 17 states. [2018-10-04 14:20:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:42,925 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-10-04 14:20:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:20:42,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-04 14:20:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:42,930 INFO L225 Difference]: With dead ends: 1442 [2018-10-04 14:20:42,931 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 14:20:42,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 28 [2018-10-04 14:20:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 14:20:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-10-04 14:20:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-04 14:20:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-10-04 14:20:43,212 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-10-04 14:20:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:43,212 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-10-04 14:20:43,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:20:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-10-04 14:20:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:20:43,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:43,213 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:43,213 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:43,213 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:43,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-10-04 14:20:43,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:43,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:43,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:43,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:43,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:43,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:43,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:43,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 14:20:43,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:20:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:20:43,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:43,467 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 16 states. [2018-10-04 14:20:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:44,559 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-10-04 14:20:44,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:44,560 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 14:20:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:44,564 INFO L225 Difference]: With dead ends: 1389 [2018-10-04 14:20:44,564 INFO L226 Difference]: Without dead ends: 1387 [2018-10-04 14:20:44,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 25 [2018-10-04 14:20:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-10-04 14:20:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-10-04 14:20:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-04 14:20:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-10-04 14:20:44,832 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-10-04 14:20:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:44,833 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-10-04 14:20:44,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:20:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-10-04 14:20:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:44,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:44,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:44,834 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:44,835 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-10-04 14:20:44,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:44,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:44,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:44,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:44,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:44,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:44,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:45,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:45,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-04 14:20:45,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:45,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:45,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:45,146 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-10-04 14:20:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:46,995 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-10-04 14:20:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:46,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-04 14:20:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:47,000 INFO L225 Difference]: With dead ends: 1445 [2018-10-04 14:20:47,000 INFO L226 Difference]: Without dead ends: 1443 [2018-10-04 14:20:47,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 23 [2018-10-04 14:20:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-10-04 14:20:47,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-10-04 14:20:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 14:20:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 14:20:47,281 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 14:20:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:47,282 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 14:20:47,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 14:20:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:47,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:47,283 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:47,283 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:47,283 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-10-04 14:20:47,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:47,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:47,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:47,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:47,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:47,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:47,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:47,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 14:20:47,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:20:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:20:47,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:47,552 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 15 states. [2018-10-04 14:20:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:49,971 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-10-04 14:20:49,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:49,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2018-10-04 14:20:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:49,976 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 14:20:49,977 INFO L226 Difference]: Without dead ends: 1418 [2018-10-04 14:20:49,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 33 [2018-10-04 14:20:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-04 14:20:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-10-04 14:20:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-10-04 14:20:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-10-04 14:20:50,258 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-10-04 14:20:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:50,258 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-10-04 14:20:50,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:20:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-10-04 14:20:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:50,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:50,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:50,259 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:50,260 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-10-04 14:20:50,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:50,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:50,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:50,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:50,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:50,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:50,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:50,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:50,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:50,446 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-10-04 14:20:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:51,403 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-10-04 14:20:51,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:51,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-04 14:20:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:51,409 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 14:20:51,409 INFO L226 Difference]: Without dead ends: 1332 [2018-10-04 14:20:51,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 12 [2018-10-04 14:20:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-10-04 14:20:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-10-04 14:20:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 14:20:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 14:20:51,689 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 14:20:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:51,689 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 14:20:51,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 14:20:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:51,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:51,690 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:51,691 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:51,691 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-10-04 14:20:51,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:51,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:52,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:52,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:52,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:52,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 14:20:52,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:20:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:20:52,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:52,184 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-10-04 14:20:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:53,165 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-10-04 14:20:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:20:53,165 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-04 14:20:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:53,171 INFO L225 Difference]: With dead ends: 1330 [2018-10-04 14:20:53,171 INFO L226 Difference]: Without dead ends: 1328 [2018-10-04 14:20:53,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 13 [2018-10-04 14:20:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-04 14:20:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-10-04 14:20:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-04 14:20:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-10-04 14:20:53,497 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-10-04 14:20:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:53,497 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-10-04 14:20:53,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:20:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-10-04 14:20:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:53,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:53,498 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:53,498 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:53,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-10-04 14:20:53,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:53,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:53,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:53,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:20:53,635 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:20:53,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:20:53,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:53,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-04 14:20:53,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:20:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:20:53,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:53,755 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 14 states. [2018-10-04 14:20:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:55,545 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-10-04 14:20:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:20:55,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-04 14:20:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:55,550 INFO L225 Difference]: With dead ends: 1430 [2018-10-04 14:20:55,550 INFO L226 Difference]: Without dead ends: 1428 [2018-10-04 14:20:55,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 31 [2018-10-04 14:20:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-10-04 14:20:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-10-04 14:20:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 14:20:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 14:20:55,814 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 14:20:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 14:20:55,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:20:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 14:20:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:20:55,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:55,815 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:55,815 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:55,815 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-10-04 14:20:55,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:55,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:20:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:56,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:56,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:56,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:56,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:20:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-10-04 14:20:56,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:20:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:20:56,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:56,186 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-10-04 14:20:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:20:57,860 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-10-04 14:20:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:20:57,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-10-04 14:20:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:20:57,863 INFO L225 Difference]: With dead ends: 1432 [2018-10-04 14:20:57,863 INFO L226 Difference]: Without dead ends: 1430 [2018-10-04 14:20:57,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 23 [2018-10-04 14:20:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-04 14:20:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-10-04 14:20:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-04 14:20:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-10-04 14:20:58,155 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-10-04 14:20:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:20:58,155 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-10-04 14:20:58,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:20:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-10-04 14:20:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:20:58,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:20:58,157 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:20:58,157 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:20:58,157 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:20:58,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-10-04 14:20:58,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:20:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:20:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:20:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:58,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:20:58,739 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:20:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:20:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:20:58,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:20:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:20:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:20:58,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-10-04 14:20:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:20:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:20:58,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:20:58,863 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-10-04 14:21:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:02,734 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-10-04 14:21:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:21:02,734 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 14:21:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:02,736 INFO L225 Difference]: With dead ends: 1695 [2018-10-04 14:21:02,736 INFO L226 Difference]: Without dead ends: 1376 [2018-10-04 14:21:02,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.7s impTime 28 [2018-10-04 14:21:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-04 14:21:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-10-04 14:21:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-04 14:21:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-10-04 14:21:02,992 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-10-04 14:21:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:02,992 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-10-04 14:21:02,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:21:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-10-04 14:21:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:02,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:02,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:02,994 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:02,994 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-10-04 14:21:02,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:03,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:03,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:03,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:03,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:03,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:03,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 14:21:03,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:03,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:03,919 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-10-04 14:21:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:05,709 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-10-04 14:21:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:21:05,710 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 14:21:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:05,713 INFO L225 Difference]: With dead ends: 1514 [2018-10-04 14:21:05,713 INFO L226 Difference]: Without dead ends: 1219 [2018-10-04 14:21:05,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 22 [2018-10-04 14:21:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-04 14:21:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-10-04 14:21:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-04 14:21:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-10-04 14:21:06,208 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-10-04 14:21:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:06,208 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-10-04 14:21:06,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-10-04 14:21:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:06,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:06,210 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:06,210 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:06,210 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-10-04 14:21:06,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:06,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:06,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:06,457 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:06,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:06,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:06,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-04 14:21:06,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:06,612 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:06,612 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-10-04 14:21:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:08,302 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-10-04 14:21:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:21:08,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 14:21:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:08,305 INFO L225 Difference]: With dead ends: 2556 [2018-10-04 14:21:08,305 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 14:21:08,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 22 [2018-10-04 14:21:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 14:21:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-10-04 14:21:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-10-04 14:21:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-10-04 14:21:08,613 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-10-04 14:21:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:08,613 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-10-04 14:21:08,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-10-04 14:21:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:08,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:08,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:08,614 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:08,615 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-10-04 14:21:08,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:08,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:08,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:08,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:08,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:08,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:21:08,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:21:08,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:21:08,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:08,884 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-10-04 14:21:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:10,519 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-10-04 14:21:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:21:10,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-04 14:21:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:10,522 INFO L225 Difference]: With dead ends: 1546 [2018-10-04 14:21:10,522 INFO L226 Difference]: Without dead ends: 1291 [2018-10-04 14:21:10,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 22 [2018-10-04 14:21:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-04 14:21:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-10-04 14:21:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-10-04 14:21:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-10-04 14:21:10,819 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-10-04 14:21:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:10,819 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-10-04 14:21:10,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:21:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-10-04 14:21:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:21:10,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:10,820 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:10,820 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:10,821 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-10-04 14:21:10,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:10,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:10,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:10,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:10,895 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:10,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:10,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:10,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:10,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:10,956 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-10-04 14:21:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:11,703 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-10-04 14:21:11,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:21:11,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-04 14:21:11,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:11,708 INFO L225 Difference]: With dead ends: 1635 [2018-10-04 14:21:11,708 INFO L226 Difference]: Without dead ends: 1494 [2018-10-04 14:21:11,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 14:21:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-04 14:21:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-10-04 14:21:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 14:21:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-10-04 14:21:12,128 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-10-04 14:21:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:12,128 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-10-04 14:21:12,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-10-04 14:21:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:21:12,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:12,129 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 14:21:12,129 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:12,129 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-10-04 14:21:12,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:12,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:12,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:12,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:12,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:12,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:12,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2018-10-04 14:21:12,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:21:12,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:21:12,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:12,435 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 20 states. [2018-10-04 14:21:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:16,277 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-10-04 14:21:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:21:16,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 14:21:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:16,279 INFO L225 Difference]: With dead ends: 2230 [2018-10-04 14:21:16,279 INFO L226 Difference]: Without dead ends: 2180 [2018-10-04 14:21:16,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 47 [2018-10-04 14:21:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-10-04 14:21:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-10-04 14:21:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-10-04 14:21:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-10-04 14:21:16,776 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-10-04 14:21:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:16,776 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-10-04 14:21:16,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:21:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-10-04 14:21:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:21:16,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:16,777 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:16,777 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:16,777 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-10-04 14:21:16,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:16,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:16,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:16,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:16,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:16,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:16,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:21:16,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:21:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:21:16,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:16,914 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-10-04 14:21:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:17,478 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-10-04 14:21:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:21:17,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-04 14:21:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:17,480 INFO L225 Difference]: With dead ends: 1760 [2018-10-04 14:21:17,480 INFO L226 Difference]: Without dead ends: 1507 [2018-10-04 14:21:17,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 14:21:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-04 14:21:17,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-10-04 14:21:17,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-10-04 14:21:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-10-04 14:21:17,770 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-10-04 14:21:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:17,770 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-10-04 14:21:17,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:21:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-10-04 14:21:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:21:17,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:17,771 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 14:21:17,771 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:17,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-10-04 14:21:17,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:17,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:17,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:17,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:17,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:17,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:18,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:18,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 14:21:18,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:21:18,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:21:18,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:18,093 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 17 states. [2018-10-04 14:21:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:20,406 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-10-04 14:21:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:21:20,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-10-04 14:21:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:20,408 INFO L225 Difference]: With dead ends: 1878 [2018-10-04 14:21:20,408 INFO L226 Difference]: Without dead ends: 1729 [2018-10-04 14:21:20,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 31 [2018-10-04 14:21:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-04 14:21:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-10-04 14:21:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 14:21:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-10-04 14:21:20,732 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-10-04 14:21:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:20,732 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-10-04 14:21:20,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:21:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-10-04 14:21:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:20,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:20,733 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:20,733 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:20,733 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-10-04 14:21:20,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:20,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:21:20,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:20,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:20,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:20,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:21,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:21,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 14:21:21,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:21:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:21:21,136 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:21,136 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-10-04 14:21:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:24,650 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-10-04 14:21:24,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:21:24,650 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 14:21:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:24,652 INFO L225 Difference]: With dead ends: 2738 [2018-10-04 14:21:24,652 INFO L226 Difference]: Without dead ends: 1726 [2018-10-04 14:21:24,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 49 [2018-10-04 14:21:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-10-04 14:21:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-10-04 14:21:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-04 14:21:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-10-04 14:21:25,064 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-10-04 14:21:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:25,064 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-10-04 14:21:25,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:21:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-10-04 14:21:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:25,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:25,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:25,065 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:25,066 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-10-04 14:21:25,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:25,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:25,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:25,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:25,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:25,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:26,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:26,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:21:26,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:21:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:21:26,435 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:26,435 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 20 states. [2018-10-04 14:21:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:30,671 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-10-04 14:21:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 14:21:30,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 14:21:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:30,673 INFO L225 Difference]: With dead ends: 2759 [2018-10-04 14:21:30,674 INFO L226 Difference]: Without dead ends: 2757 [2018-10-04 14:21:30,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.7s impTime 61 [2018-10-04 14:21:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-10-04 14:21:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-10-04 14:21:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-10-04 14:21:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-10-04 14:21:31,193 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-10-04 14:21:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:31,193 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-10-04 14:21:31,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:21:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-10-04 14:21:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:31,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:31,194 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:31,194 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:31,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:31,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-10-04 14:21:31,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:31,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:31,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:31,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:31,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:31,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:31,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-04 14:21:31,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:31,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:31,488 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 18 states. [2018-10-04 14:21:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:35,081 INFO L93 Difference]: Finished difference Result 2657 states and 4320 transitions. [2018-10-04 14:21:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:21:35,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 14:21:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:35,084 INFO L225 Difference]: With dead ends: 2657 [2018-10-04 14:21:35,084 INFO L226 Difference]: Without dead ends: 2655 [2018-10-04 14:21:35,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 52 [2018-10-04 14:21:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-10-04 14:21:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1726. [2018-10-04 14:21:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-10-04 14:21:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2827 transitions. [2018-10-04 14:21:35,586 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2827 transitions. Word has length 21 [2018-10-04 14:21:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:35,586 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2827 transitions. [2018-10-04 14:21:35,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2827 transitions. [2018-10-04 14:21:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:35,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:35,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:35,587 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:35,587 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1327798635, now seen corresponding path program 1 times [2018-10-04 14:21:35,587 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:35,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:35,781 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:35,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:35,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:36,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:36,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-04 14:21:36,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:21:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:21:36,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:36,027 INFO L87 Difference]: Start difference. First operand 1726 states and 2827 transitions. Second operand 19 states. [2018-10-04 14:21:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:39,866 INFO L93 Difference]: Finished difference Result 2434 states and 3937 transitions. [2018-10-04 14:21:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:21:39,866 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 14:21:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:39,869 INFO L225 Difference]: With dead ends: 2434 [2018-10-04 14:21:39,869 INFO L226 Difference]: Without dead ends: 2432 [2018-10-04 14:21:39,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 54 [2018-10-04 14:21:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-10-04 14:21:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1872. [2018-10-04 14:21:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2018-10-04 14:21:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3060 transitions. [2018-10-04 14:21:40,936 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3060 transitions. Word has length 21 [2018-10-04 14:21:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 3060 transitions. [2018-10-04 14:21:40,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:21:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3060 transitions. [2018-10-04 14:21:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:40,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:40,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:40,938 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:40,938 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 133649308, now seen corresponding path program 2 times [2018-10-04 14:21:40,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:40,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:40,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:41,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:41,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:41,413 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:41,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:41,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:21:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 14:21:41,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:21:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:21:41,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:41,520 INFO L87 Difference]: Start difference. First operand 1872 states and 3060 transitions. Second operand 16 states. [2018-10-04 14:21:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:44,287 INFO L93 Difference]: Finished difference Result 2526 states and 4072 transitions. [2018-10-04 14:21:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:21:44,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-04 14:21:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:44,290 INFO L225 Difference]: With dead ends: 2526 [2018-10-04 14:21:44,290 INFO L226 Difference]: Without dead ends: 2334 [2018-10-04 14:21:44,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 34 [2018-10-04 14:21:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-04 14:21:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2001. [2018-10-04 14:21:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-10-04 14:21:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3219 transitions. [2018-10-04 14:21:44,934 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3219 transitions. Word has length 21 [2018-10-04 14:21:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:44,935 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 3219 transitions. [2018-10-04 14:21:44,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:21:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3219 transitions. [2018-10-04 14:21:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:44,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:44,936 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:44,936 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:44,936 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-10-04 14:21:44,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:44,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:21:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:45,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:45,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:45,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:45,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:45,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-04 14:21:45,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:45,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:45,209 INFO L87 Difference]: Start difference. First operand 2001 states and 3219 transitions. Second operand 18 states. [2018-10-04 14:21:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:49,555 INFO L93 Difference]: Finished difference Result 2607 states and 4131 transitions. [2018-10-04 14:21:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 14:21:49,556 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 14:21:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:49,559 INFO L225 Difference]: With dead ends: 2607 [2018-10-04 14:21:49,559 INFO L226 Difference]: Without dead ends: 2605 [2018-10-04 14:21:49,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.2s impTime 57 [2018-10-04 14:21:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2018-10-04 14:21:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1559. [2018-10-04 14:21:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2018-10-04 14:21:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2486 transitions. [2018-10-04 14:21:50,059 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2486 transitions. Word has length 21 [2018-10-04 14:21:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:50,059 INFO L480 AbstractCegarLoop]: Abstraction has 1559 states and 2486 transitions. [2018-10-04 14:21:50,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2486 transitions. [2018-10-04 14:21:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:50,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:50,060 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:50,061 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:50,061 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1950062829, now seen corresponding path program 1 times [2018-10-04 14:21:50,061 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:50,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:50,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:50,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:50,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:50,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:50,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:50,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 14:21:50,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:50,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:50,605 INFO L87 Difference]: Start difference. First operand 1559 states and 2486 transitions. Second operand 18 states. [2018-10-04 14:21:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:55,690 INFO L93 Difference]: Finished difference Result 2107 states and 3306 transitions. [2018-10-04 14:21:55,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:21:55,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 14:21:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:55,692 INFO L225 Difference]: With dead ends: 2107 [2018-10-04 14:21:55,692 INFO L226 Difference]: Without dead ends: 2105 [2018-10-04 14:21:55,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.8s impTime 62 [2018-10-04 14:21:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2018-10-04 14:21:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1432. [2018-10-04 14:21:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-10-04 14:21:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2283 transitions. [2018-10-04 14:21:56,193 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2283 transitions. Word has length 21 [2018-10-04 14:21:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:21:56,193 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 2283 transitions. [2018-10-04 14:21:56,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:21:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2283 transitions. [2018-10-04 14:21:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:21:56,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:21:56,194 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:21:56,194 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:21:56,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:21:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 830618954, now seen corresponding path program 2 times [2018-10-04 14:21:56,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:21:56,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:21:56,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:21:56,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:21:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:21:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:21:56,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:21:56,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:21:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:21:56,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:21:56,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:21:56,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:21:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:21:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:21:56,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-04 14:21:56,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:21:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:21:56,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:21:56,563 INFO L87 Difference]: Start difference. First operand 1432 states and 2283 transitions. Second operand 18 states. [2018-10-04 14:21:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:21:59,855 INFO L93 Difference]: Finished difference Result 1886 states and 2991 transitions. [2018-10-04 14:21:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:21:59,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 14:21:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:21:59,857 INFO L225 Difference]: With dead ends: 1886 [2018-10-04 14:21:59,857 INFO L226 Difference]: Without dead ends: 1884 [2018-10-04 14:21:59,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 41 [2018-10-04 14:21:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-10-04 14:22:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1404. [2018-10-04 14:22:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-10-04 14:22:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2237 transitions. [2018-10-04 14:22:00,373 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2237 transitions. Word has length 21 [2018-10-04 14:22:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:00,373 INFO L480 AbstractCegarLoop]: Abstraction has 1404 states and 2237 transitions. [2018-10-04 14:22:00,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2237 transitions. [2018-10-04 14:22:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:00,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:00,374 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:00,375 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:00,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 822030785, now seen corresponding path program 1 times [2018-10-04 14:22:00,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:00,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:00,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:00,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:00,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:00,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 14:22:00,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:22:00,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:22:00,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:00,738 INFO L87 Difference]: Start difference. First operand 1404 states and 2237 transitions. Second operand 20 states. [2018-10-04 14:22:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:05,344 INFO L93 Difference]: Finished difference Result 2676 states and 4218 transitions. [2018-10-04 14:22:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:22:05,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 14:22:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:05,346 INFO L225 Difference]: With dead ends: 2676 [2018-10-04 14:22:05,346 INFO L226 Difference]: Without dead ends: 1637 [2018-10-04 14:22:05,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.6s impTime 60 [2018-10-04 14:22:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-04 14:22:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1391. [2018-10-04 14:22:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2018-10-04 14:22:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2209 transitions. [2018-10-04 14:22:05,901 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2209 transitions. Word has length 21 [2018-10-04 14:22:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:05,901 INFO L480 AbstractCegarLoop]: Abstraction has 1391 states and 2209 transitions. [2018-10-04 14:22:05,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:22:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2209 transitions. [2018-10-04 14:22:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:05,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:05,902 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:05,902 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:05,902 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:05,902 INFO L82 PathProgramCache]: Analyzing trace with hash 822032067, now seen corresponding path program 2 times [2018-10-04 14:22:05,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:05,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:05,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:06,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:06,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:06,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:06,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:06,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:06,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:06,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2018-10-04 14:22:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:22:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:22:06,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:06,187 INFO L87 Difference]: Start difference. First operand 1391 states and 2209 transitions. Second operand 18 states. [2018-10-04 14:22:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:11,161 INFO L93 Difference]: Finished difference Result 2169 states and 3390 transitions. [2018-10-04 14:22:11,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 14:22:11,162 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 14:22:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:11,163 INFO L225 Difference]: With dead ends: 2169 [2018-10-04 14:22:11,163 INFO L226 Difference]: Without dead ends: 2167 [2018-10-04 14:22:11,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 74 [2018-10-04 14:22:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-10-04 14:22:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1375. [2018-10-04 14:22:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2018-10-04 14:22:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2186 transitions. [2018-10-04 14:22:11,731 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2186 transitions. Word has length 21 [2018-10-04 14:22:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:11,731 INFO L480 AbstractCegarLoop]: Abstraction has 1375 states and 2186 transitions. [2018-10-04 14:22:11,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2186 transitions. [2018-10-04 14:22:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:11,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:11,732 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:11,733 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:11,733 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash -97849607, now seen corresponding path program 1 times [2018-10-04 14:22:11,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:11,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:11,897 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:11,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:11,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:12,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:12,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 14:22:12,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:12,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:12,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:12,139 INFO L87 Difference]: Start difference. First operand 1375 states and 2186 transitions. Second operand 19 states. [2018-10-04 14:22:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:15,164 INFO L93 Difference]: Finished difference Result 3096 states and 4913 transitions. [2018-10-04 14:22:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:22:15,165 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 14:22:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:15,166 INFO L225 Difference]: With dead ends: 3096 [2018-10-04 14:22:15,166 INFO L226 Difference]: Without dead ends: 1770 [2018-10-04 14:22:15,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 40 [2018-10-04 14:22:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-10-04 14:22:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1381. [2018-10-04 14:22:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-10-04 14:22:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2193 transitions. [2018-10-04 14:22:15,767 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2193 transitions. Word has length 21 [2018-10-04 14:22:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:15,767 INFO L480 AbstractCegarLoop]: Abstraction has 1381 states and 2193 transitions. [2018-10-04 14:22:15,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:22:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2193 transitions. [2018-10-04 14:22:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:15,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:15,768 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:15,768 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:15,769 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 437466707, now seen corresponding path program 1 times [2018-10-04 14:22:15,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:15,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:15,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:15,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:15,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:15,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:15,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:16,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:16,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-04 14:22:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:22:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:22:16,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:16,011 INFO L87 Difference]: Start difference. First operand 1381 states and 2193 transitions. Second operand 15 states. [2018-10-04 14:22:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:18,328 INFO L93 Difference]: Finished difference Result 1858 states and 2972 transitions. [2018-10-04 14:22:18,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:22:18,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-04 14:22:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:18,331 INFO L225 Difference]: With dead ends: 1858 [2018-10-04 14:22:18,331 INFO L226 Difference]: Without dead ends: 1856 [2018-10-04 14:22:18,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 32 [2018-10-04 14:22:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2018-10-04 14:22:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1551. [2018-10-04 14:22:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2018-10-04 14:22:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2486 transitions. [2018-10-04 14:22:18,978 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2486 transitions. Word has length 21 [2018-10-04 14:22:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:18,978 INFO L480 AbstractCegarLoop]: Abstraction has 1551 states and 2486 transitions. [2018-10-04 14:22:18,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:22:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2486 transitions. [2018-10-04 14:22:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:18,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:18,979 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:18,979 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:18,979 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2130898623, now seen corresponding path program 2 times [2018-10-04 14:22:18,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:18,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:19,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:19,086 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:19,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:19,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:19,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:19,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:19,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:19,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-04 14:22:19,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:19,304 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:19,304 INFO L87 Difference]: Start difference. First operand 1551 states and 2486 transitions. Second operand 19 states. [2018-10-04 14:22:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:22,734 INFO L93 Difference]: Finished difference Result 1901 states and 3071 transitions. [2018-10-04 14:22:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:22:22,734 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 14:22:22,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:22,736 INFO L225 Difference]: With dead ends: 1901 [2018-10-04 14:22:22,736 INFO L226 Difference]: Without dead ends: 1899 [2018-10-04 14:22:22,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 38 [2018-10-04 14:22:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2018-10-04 14:22:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1583. [2018-10-04 14:22:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-10-04 14:22:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2523 transitions. [2018-10-04 14:22:23,375 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2523 transitions. Word has length 21 [2018-10-04 14:22:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:23,375 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 2523 transitions. [2018-10-04 14:22:23,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:22:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2523 transitions. [2018-10-04 14:22:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:23,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:23,376 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:23,376 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:23,377 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2139486792, now seen corresponding path program 1 times [2018-10-04 14:22:23,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:23,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:23,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:23,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:23,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:23,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:23,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-04 14:22:23,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:23,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:23,699 INFO L87 Difference]: Start difference. First operand 1583 states and 2523 transitions. Second operand 17 states. [2018-10-04 14:22:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:26,309 INFO L93 Difference]: Finished difference Result 2207 states and 3564 transitions. [2018-10-04 14:22:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:22:26,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-04 14:22:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:26,311 INFO L225 Difference]: With dead ends: 2207 [2018-10-04 14:22:26,311 INFO L226 Difference]: Without dead ends: 2205 [2018-10-04 14:22:26,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 34 [2018-10-04 14:22:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-04 14:22:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1741. [2018-10-04 14:22:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2018-10-04 14:22:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2777 transitions. [2018-10-04 14:22:27,023 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2777 transitions. Word has length 21 [2018-10-04 14:22:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:27,024 INFO L480 AbstractCegarLoop]: Abstraction has 1741 states and 2777 transitions. [2018-10-04 14:22:27,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:22:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2777 transitions. [2018-10-04 14:22:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:27,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:27,025 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:27,025 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:27,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1673653662, now seen corresponding path program 2 times [2018-10-04 14:22:27,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:27,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:27,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:27,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:27,278 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:27,278 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:27,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:27,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:27,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-04 14:22:27,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:22:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:22:27,406 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:27,406 INFO L87 Difference]: Start difference. First operand 1741 states and 2777 transitions. Second operand 15 states. [2018-10-04 14:22:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:31,784 INFO L93 Difference]: Finished difference Result 3370 states and 5507 transitions. [2018-10-04 14:22:31,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:22:31,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-04 14:22:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:31,787 INFO L225 Difference]: With dead ends: 3370 [2018-10-04 14:22:31,788 INFO L226 Difference]: Without dead ends: 3368 [2018-10-04 14:22:31,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 44 [2018-10-04 14:22:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2018-10-04 14:22:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2044. [2018-10-04 14:22:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-04 14:22:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3284 transitions. [2018-10-04 14:22:32,570 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3284 transitions. Word has length 21 [2018-10-04 14:22:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:32,571 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 3284 transitions. [2018-10-04 14:22:32,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:22:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3284 transitions. [2018-10-04 14:22:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:22:32,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:32,572 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:32,572 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:32,572 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:32,572 INFO L82 PathProgramCache]: Analyzing trace with hash 212422270, now seen corresponding path program 2 times [2018-10-04 14:22:32,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:32,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:32,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:32,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:32,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-04 14:22:32,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:32,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:32,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:32,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:32,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:32,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 14:22:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 14:22:32,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:22:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:22:32,740 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:32,740 INFO L87 Difference]: Start difference. First operand 2044 states and 3284 transitions. Second operand 12 states. [2018-10-04 14:22:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:35,207 INFO L93 Difference]: Finished difference Result 5216 states and 8321 transitions. [2018-10-04 14:22:35,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:22:35,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-04 14:22:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:35,210 INFO L225 Difference]: With dead ends: 5216 [2018-10-04 14:22:35,210 INFO L226 Difference]: Without dead ends: 3229 [2018-10-04 14:22:35,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 19 [2018-10-04 14:22:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-10-04 14:22:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2942. [2018-10-04 14:22:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2018-10-04 14:22:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4622 transitions. [2018-10-04 14:22:36,371 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4622 transitions. Word has length 21 [2018-10-04 14:22:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,371 INFO L480 AbstractCegarLoop]: Abstraction has 2942 states and 4622 transitions. [2018-10-04 14:22:36,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:22:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4622 transitions. [2018-10-04 14:22:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:22:36,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,372 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:36,373 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,373 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1977173104, now seen corresponding path program 1 times [2018-10-04 14:22:36,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:36,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:36,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:36,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-04 14:22:36,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:22:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:22:36,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:36,905 INFO L87 Difference]: Start difference. First operand 2942 states and 4622 transitions. Second operand 22 states. [2018-10-04 14:22:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:45,162 INFO L93 Difference]: Finished difference Result 4706 states and 7339 transitions. [2018-10-04 14:22:45,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:22:45,162 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-04 14:22:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:45,167 INFO L225 Difference]: With dead ends: 4706 [2018-10-04 14:22:45,167 INFO L226 Difference]: Without dead ends: 4704 [2018-10-04 14:22:45,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.4s impTime 63 [2018-10-04 14:22:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-04 14:22:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3514. [2018-10-04 14:22:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-10-04 14:22:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5500 transitions. [2018-10-04 14:22:46,996 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5500 transitions. Word has length 23 [2018-10-04 14:22:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:46,997 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 5500 transitions. [2018-10-04 14:22:46,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:22:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5500 transitions. [2018-10-04 14:22:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:22:46,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:46,998 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:46,998 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:46,998 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1266805704, now seen corresponding path program 1 times [2018-10-04 14:22:46,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:46,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:46,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:46,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:47,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:47,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:47,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:47,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:47,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-04 14:22:47,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:22:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:22:47,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:47,354 INFO L87 Difference]: Start difference. First operand 3514 states and 5500 transitions. Second operand 21 states. [2018-10-04 14:22:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:54,263 INFO L93 Difference]: Finished difference Result 4911 states and 7636 transitions. [2018-10-04 14:22:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:22:54,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-10-04 14:22:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:54,267 INFO L225 Difference]: With dead ends: 4911 [2018-10-04 14:22:54,268 INFO L226 Difference]: Without dead ends: 4904 [2018-10-04 14:22:54,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 47 [2018-10-04 14:22:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2018-10-04 14:22:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 2925. [2018-10-04 14:22:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-10-04 14:22:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4501 transitions. [2018-10-04 14:22:56,369 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4501 transitions. Word has length 23 [2018-10-04 14:22:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:56,370 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 4501 transitions. [2018-10-04 14:22:56,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:22:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4501 transitions. [2018-10-04 14:22:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:22:56,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:56,371 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:56,371 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:56,371 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -407447728, now seen corresponding path program 1 times [2018-10-04 14:22:56,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:56,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:56,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:56,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:56,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:56,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:22:56,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-10-04 14:22:56,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:22:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:22:56,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:56,804 INFO L87 Difference]: Start difference. First operand 2925 states and 4501 transitions. Second operand 22 states. [2018-10-04 14:23:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:02,520 INFO L93 Difference]: Finished difference Result 3641 states and 5640 transitions. [2018-10-04 14:23:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:23:02,520 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-04 14:23:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:02,523 INFO L225 Difference]: With dead ends: 3641 [2018-10-04 14:23:02,524 INFO L226 Difference]: Without dead ends: 3634 [2018-10-04 14:23:02,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 49 [2018-10-04 14:23:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2018-10-04 14:23:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 2472. [2018-10-04 14:23:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-10-04 14:23:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3826 transitions. [2018-10-04 14:23:03,968 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3826 transitions. Word has length 23 [2018-10-04 14:23:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:03,968 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3826 transitions. [2018-10-04 14:23:03,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:23:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3826 transitions. [2018-10-04 14:23:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:23:03,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:03,970 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:03,970 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:03,970 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1545525427, now seen corresponding path program 1 times [2018-10-04 14:23:03,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:03,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:03,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:04,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:04,089 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:04,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:04,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:04,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:04,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-04 14:23:04,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:23:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:23:04,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:04,351 INFO L87 Difference]: Start difference. First operand 2472 states and 3826 transitions. Second operand 16 states. [2018-10-04 14:23:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:08,547 INFO L93 Difference]: Finished difference Result 3028 states and 4680 transitions. [2018-10-04 14:23:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:23:08,547 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-04 14:23:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:08,550 INFO L225 Difference]: With dead ends: 3028 [2018-10-04 14:23:08,550 INFO L226 Difference]: Without dead ends: 3026 [2018-10-04 14:23:08,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 35 [2018-10-04 14:23:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-10-04 14:23:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2443. [2018-10-04 14:23:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2018-10-04 14:23:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3774 transitions. [2018-10-04 14:23:10,082 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3774 transitions. Word has length 24 [2018-10-04 14:23:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:10,082 INFO L480 AbstractCegarLoop]: Abstraction has 2443 states and 3774 transitions. [2018-10-04 14:23:10,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:23:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3774 transitions. [2018-10-04 14:23:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:23:10,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:10,083 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:23:10,083 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:10,084 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -136248690, now seen corresponding path program 3 times [2018-10-04 14:23:10,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:10,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:10,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:10,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:23:10,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:10,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:10,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:10,277 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-04 14:23:10,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:10,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-04 14:23:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:10,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-10-04 14:23:10,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:23:10,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:23:10,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:10,437 INFO L87 Difference]: Start difference. First operand 2443 states and 3774 transitions. Second operand 16 states. [2018-10-04 14:23:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:13,446 INFO L93 Difference]: Finished difference Result 2592 states and 4005 transitions. [2018-10-04 14:23:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:23:13,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-04 14:23:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:13,449 INFO L225 Difference]: With dead ends: 2592 [2018-10-04 14:23:13,449 INFO L226 Difference]: Without dead ends: 2590 [2018-10-04 14:23:13,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 32 [2018-10-04 14:23:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-10-04 14:23:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2279. [2018-10-04 14:23:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-10-04 14:23:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3506 transitions. [2018-10-04 14:23:15,057 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3506 transitions. Word has length 24 [2018-10-04 14:23:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:15,057 INFO L480 AbstractCegarLoop]: Abstraction has 2279 states and 3506 transitions. [2018-10-04 14:23:15,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:23:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3506 transitions. [2018-10-04 14:23:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 14:23:15,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:15,058 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:15,058 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:15,058 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash -518454402, now seen corresponding path program 1 times [2018-10-04 14:23:15,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:15,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:15,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:15,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:15,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:15,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:15,158 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:15,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:15,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:15,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:15,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-04 14:23:15,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:23:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:23:15,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:15,297 INFO L87 Difference]: Start difference. First operand 2279 states and 3506 transitions. Second operand 16 states. [2018-10-04 14:23:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:18,597 INFO L93 Difference]: Finished difference Result 2414 states and 3709 transitions. [2018-10-04 14:23:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:23:18,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-04 14:23:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:18,600 INFO L225 Difference]: With dead ends: 2414 [2018-10-04 14:23:18,600 INFO L226 Difference]: Without dead ends: 2412 [2018-10-04 14:23:18,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 30 [2018-10-04 14:23:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2018-10-04 14:23:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2274. [2018-10-04 14:23:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2018-10-04 14:23:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3496 transitions. [2018-10-04 14:23:20,208 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3496 transitions. Word has length 24 [2018-10-04 14:23:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:20,208 INFO L480 AbstractCegarLoop]: Abstraction has 2274 states and 3496 transitions. [2018-10-04 14:23:20,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:23:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3496 transitions. [2018-10-04 14:23:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:23:20,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:20,210 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:20,210 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:20,211 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -916627202, now seen corresponding path program 1 times [2018-10-04 14:23:20,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:20,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:20,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:20,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:20,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:20,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 14:23:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-04 14:23:20,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:23:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:23:20,681 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:20,681 INFO L87 Difference]: Start difference. First operand 2274 states and 3496 transitions. Second operand 20 states. [2018-10-04 14:23:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:25,019 INFO L93 Difference]: Finished difference Result 2734 states and 4210 transitions. [2018-10-04 14:23:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:23:25,019 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-04 14:23:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:25,021 INFO L225 Difference]: With dead ends: 2734 [2018-10-04 14:23:25,021 INFO L226 Difference]: Without dead ends: 2732 [2018-10-04 14:23:25,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 39 [2018-10-04 14:23:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-10-04 14:23:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2357. [2018-10-04 14:23:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2018-10-04 14:23:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3634 transitions. [2018-10-04 14:23:26,679 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3634 transitions. Word has length 29 [2018-10-04 14:23:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:26,679 INFO L480 AbstractCegarLoop]: Abstraction has 2357 states and 3634 transitions. [2018-10-04 14:23:26,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:23:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3634 transitions. [2018-10-04 14:23:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:23:26,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:26,680 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:26,681 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:26,681 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 524508242, now seen corresponding path program 1 times [2018-10-04 14:23:26,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:26,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:26,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:26,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:26,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:26,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:26,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:27,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:27,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 14:23:27,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:23:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:23:27,190 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:27,190 INFO L87 Difference]: Start difference. First operand 2357 states and 3634 transitions. Second operand 21 states. [2018-10-04 14:23:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:37,004 INFO L93 Difference]: Finished difference Result 5146 states and 8058 transitions. [2018-10-04 14:23:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:23:37,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-04 14:23:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:37,009 INFO L225 Difference]: With dead ends: 5146 [2018-10-04 14:23:37,009 INFO L226 Difference]: Without dead ends: 5144 [2018-10-04 14:23:37,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 78 [2018-10-04 14:23:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2018-10-04 14:23:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 3465. [2018-10-04 14:23:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-10-04 14:23:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5438 transitions. [2018-10-04 14:23:39,345 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 5438 transitions. Word has length 29 [2018-10-04 14:23:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:39,346 INFO L480 AbstractCegarLoop]: Abstraction has 3465 states and 5438 transitions. [2018-10-04 14:23:39,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:23:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 5438 transitions. [2018-10-04 14:23:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 14:23:39,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:39,347 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:39,347 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:39,348 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1958472419, now seen corresponding path program 4 times [2018-10-04 14:23:39,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:39,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:39,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:39,558 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:39,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:39,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:39,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:39,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 14:23:39,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:23:39,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:23:39,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:39,768 INFO L87 Difference]: Start difference. First operand 3465 states and 5438 transitions. Second operand 21 states. [2018-10-04 14:23:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:49,044 INFO L93 Difference]: Finished difference Result 4974 states and 7795 transitions. [2018-10-04 14:23:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:23:49,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-04 14:23:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:49,049 INFO L225 Difference]: With dead ends: 4974 [2018-10-04 14:23:49,050 INFO L226 Difference]: Without dead ends: 4972 [2018-10-04 14:23:49,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime 63 [2018-10-04 14:23:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2018-10-04 14:23:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 3050. [2018-10-04 14:23:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2018-10-04 14:23:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4722 transitions. [2018-10-04 14:23:51,276 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4722 transitions. Word has length 29 [2018-10-04 14:23:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:51,276 INFO L480 AbstractCegarLoop]: Abstraction has 3050 states and 4722 transitions. [2018-10-04 14:23:51,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:23:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4722 transitions. [2018-10-04 14:23:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 14:23:51,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:51,278 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:23:51,279 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:51,279 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1748672885, now seen corresponding path program 1 times [2018-10-04 14:23:51,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:51,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:51,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:51,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:51,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:51,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:51,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 14:23:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2018-10-04 14:23:51,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:23:51,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:23:51,765 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:51,766 INFO L87 Difference]: Start difference. First operand 3050 states and 4722 transitions. Second operand 24 states. Received shutdown request... [2018-10-04 14:24:08,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-04 14:24:08,105 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:24:08,110 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:24:08,111 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:24:08 BoogieIcfgContainer [2018-10-04 14:24:08,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:24:08,112 INFO L168 Benchmark]: Toolchain (without parser) took 253244.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 376.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:08,114 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:08,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:08,115 INFO L168 Benchmark]: Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:24:08,115 INFO L168 Benchmark]: RCFGBuilder took 556.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:24:08,116 INFO L168 Benchmark]: TraceAbstraction took 252620.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 355.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-04 14:24:08,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 556.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252620.84 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.7 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 355.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (3050states) and FLOYD_HOARE automaton (currently 180 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (3016 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (3050states) and FLOYD_HOARE automaton (currently 180 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (3016 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (3050states) and FLOYD_HOARE automaton (currently 180 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (3016 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (3050states) and FLOYD_HOARE automaton (currently 180 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (3016 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 252.5s OverallTime, 71 OverallIterations, 5 TraceHistogramMax, 191.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2669 SDtfs, 14490 SDslu, 10002 SDs, 0 SdLazy, 80593 SolverSat, 8138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 71.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3972 GetRequests, 751 SyntacticMatches, 1 SemanticMatches, 3220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3514occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 34.3s AutomataMinimizationTime, 70 MinimizatonAttempts, 26954 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 2299 NumberOfCodeBlocks, 2293 NumberOfCodeBlocksAsserted, 144 NumberOfCheckSat, 2164 ConstructedInterpolants, 316 QuantifiedInterpolants, 311906 SizeOfPredicates, 299 NumberOfNonLiveVariables, 3148 ConjunctsInSsa, 635 ConjunctsInUnsatCore, 135 InterpolantComputations, 14 PerfectInterpolantSequences, 245/1300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-24-08-131.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-24-08-131.csv Completed graceful shutdown