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.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:06:16,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:16,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:16,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:16,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:16,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:16,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:16,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:16,982 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:16,983 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:16,984 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:16,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:16,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:16,986 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:16,987 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:16,988 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:16,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:16,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:16,992 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:16,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:16,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:16,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:16,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:16,999 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:17,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:17,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:17,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:17,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:17,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:17,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:17,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:17,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:17,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:17,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:17,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:17,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:17,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:06:17,035 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:17,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:17,036 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:17,036 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:17,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:17,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:17,040 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:17,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:17,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:17,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:17,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:17,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:17,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:17,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:17,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:17,044 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:17,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:17,045 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:17,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:17,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:17,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:17,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:17,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:17,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:17,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:17,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:17,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:17,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:17,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:17,049 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:17,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:17,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:17,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:17,141 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:17,142 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:17,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-09-30 20:06:17,144 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-09-30 20:06:17,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:17,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:17,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:17,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:17,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:17,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,278 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:17,278 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:17,278 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:17,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:17,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:17,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:17,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:17,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/1) ... [2018-09-30 20:06:17,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:17,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:17,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:17,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:17,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (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-09-30 20:06:17,399 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:06:17,399 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:06:17,399 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:06:18,607 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:18,607 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:18 BoogieIcfgContainer [2018-09-30 20:06:18,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:18,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:18,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:18,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:18,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:17" (1/2) ... [2018-09-30 20:06:18,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6441383e and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:18, skipping insertion in model container [2018-09-30 20:06:18,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:18" (2/2) ... [2018-09-30 20:06:18,621 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-09-30 20:06:18,632 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:18,647 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-09-30 20:06:18,695 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:18,696 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:18,696 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:18,696 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:18,697 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:18,697 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:18,697 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:18,697 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:18,697 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-09-30 20:06:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:18,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:18,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:06:18,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:18,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 45506320, now seen corresponding path program 1 times [2018-09-30 20:06:18,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:19,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:19,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:19,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:19,052 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 5 states. [2018-09-30 20:06:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:20,630 INFO L93 Difference]: Finished difference Result 142 states and 303 transitions. [2018-09-30 20:06:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:06:20,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:06:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:20,652 INFO L225 Difference]: With dead ends: 142 [2018-09-30 20:06:20,652 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 20:06:20,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 20:06:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2018-09-30 20:06:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 20:06:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 219 transitions. [2018-09-30 20:06:20,718 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 219 transitions. Word has length 5 [2018-09-30 20:06:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:20,719 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 219 transitions. [2018-09-30 20:06:20,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 219 transitions. [2018-09-30 20:06:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:20,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:20,721 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:06:20,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:20,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:20,723 INFO L82 PathProgramCache]: Analyzing trace with hash 45756290, now seen corresponding path program 1 times [2018-09-30 20:06:20,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:20,895 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:20,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:20,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:20,906 INFO L87 Difference]: Start difference. First operand 98 states and 219 transitions. Second operand 5 states. [2018-09-30 20:06:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:22,343 INFO L93 Difference]: Finished difference Result 241 states and 539 transitions. [2018-09-30 20:06:22,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:06:22,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:06:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:22,360 INFO L225 Difference]: With dead ends: 241 [2018-09-30 20:06:22,360 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 20:06:22,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 20:06:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 134. [2018-09-30 20:06:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-30 20:06:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 355 transitions. [2018-09-30 20:06:22,407 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 355 transitions. Word has length 5 [2018-09-30 20:06:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 355 transitions. [2018-09-30 20:06:22,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 355 transitions. [2018-09-30 20:06:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:06:22,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:22,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:06:22,412 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:22,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 28948051, now seen corresponding path program 1 times [2018-09-30 20:06:22,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:22,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:22,516 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:22,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:06:22,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:06:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:06:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:06:22,517 INFO L87 Difference]: Start difference. First operand 134 states and 355 transitions. Second operand 5 states. [2018-09-30 20:06:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:23,717 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2018-09-30 20:06:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:06:23,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:06:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:23,722 INFO L225 Difference]: With dead ends: 269 [2018-09-30 20:06:23,722 INFO L226 Difference]: Without dead ends: 265 [2018-09-30 20:06:23,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-30 20:06:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 162. [2018-09-30 20:06:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 20:06:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 455 transitions. [2018-09-30 20:06:23,756 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 455 transitions. Word has length 5 [2018-09-30 20:06:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:23,757 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 455 transitions. [2018-09-30 20:06:23,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:06:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 455 transitions. [2018-09-30 20:06:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:23,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:23,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:23,760 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:23,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558066, now seen corresponding path program 1 times [2018-09-30 20:06:23,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:23,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:23,883 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:23,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:23,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:23,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:23,885 INFO L87 Difference]: Start difference. First operand 162 states and 455 transitions. Second operand 8 states. [2018-09-30 20:06:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:30,024 INFO L93 Difference]: Finished difference Result 790 states and 2085 transitions. [2018-09-30 20:06:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:06:30,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:30,031 INFO L225 Difference]: With dead ends: 790 [2018-09-30 20:06:30,031 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 20:06:30,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:06:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 20:06:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 278. [2018-09-30 20:06:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-30 20:06:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 854 transitions. [2018-09-30 20:06:30,083 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 854 transitions. Word has length 8 [2018-09-30 20:06:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:30,083 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 854 transitions. [2018-09-30 20:06:30,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 854 transitions. [2018-09-30 20:06:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:30,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:30,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:30,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:30,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1087558063, now seen corresponding path program 1 times [2018-09-30 20:06:30,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:30,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:30,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:30,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:30,237 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:30,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:30,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:30,239 INFO L87 Difference]: Start difference. First operand 278 states and 854 transitions. Second operand 8 states. [2018-09-30 20:06:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:33,360 INFO L93 Difference]: Finished difference Result 634 states and 1540 transitions. [2018-09-30 20:06:33,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:33,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:33,366 INFO L225 Difference]: With dead ends: 634 [2018-09-30 20:06:33,366 INFO L226 Difference]: Without dead ends: 628 [2018-09-30 20:06:33,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-09-30 20:06:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 310. [2018-09-30 20:06:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-30 20:06:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 963 transitions. [2018-09-30 20:06:33,422 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 963 transitions. Word has length 8 [2018-09-30 20:06:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:33,422 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 963 transitions. [2018-09-30 20:06:33,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 963 transitions. [2018-09-30 20:06:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:33,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:33,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:33,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:33,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1080099218, now seen corresponding path program 1 times [2018-09-30 20:06:33,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:33,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:33,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:33,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:33,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:33,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:33,532 INFO L87 Difference]: Start difference. First operand 310 states and 963 transitions. Second operand 8 states. [2018-09-30 20:06:35,049 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 20:06:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:37,672 INFO L93 Difference]: Finished difference Result 768 states and 2087 transitions. [2018-09-30 20:06:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:06:37,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:37,677 INFO L225 Difference]: With dead ends: 768 [2018-09-30 20:06:37,677 INFO L226 Difference]: Without dead ends: 537 [2018-09-30 20:06:37,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-09-30 20:06:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 334. [2018-09-30 20:06:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-30 20:06:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1037 transitions. [2018-09-30 20:06:37,729 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1037 transitions. Word has length 8 [2018-09-30 20:06:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:37,730 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1037 transitions. [2018-09-30 20:06:37,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1037 transitions. [2018-09-30 20:06:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:37,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:37,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:37,732 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:37,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595081, now seen corresponding path program 1 times [2018-09-30 20:06:37,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:37,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:37,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:37,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:37,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:37,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:37,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:37,973 INFO L87 Difference]: Start difference. First operand 334 states and 1037 transitions. Second operand 8 states. [2018-09-30 20:06:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:40,442 INFO L93 Difference]: Finished difference Result 1145 states and 3146 transitions. [2018-09-30 20:06:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:40,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:40,449 INFO L225 Difference]: With dead ends: 1145 [2018-09-30 20:06:40,449 INFO L226 Difference]: Without dead ends: 812 [2018-09-30 20:06:40,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2018-09-30 20:06:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 450. [2018-09-30 20:06:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-09-30 20:06:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1432 transitions. [2018-09-30 20:06:40,517 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1432 transitions. Word has length 8 [2018-09-30 20:06:40,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:40,517 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1432 transitions. [2018-09-30 20:06:40,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1432 transitions. [2018-09-30 20:06:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:40,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:40,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:40,520 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:40,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:40,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1224595078, now seen corresponding path program 1 times [2018-09-30 20:06:40,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:40,685 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:40,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:40,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:40,686 INFO L87 Difference]: Start difference. First operand 450 states and 1432 transitions. Second operand 8 states. [2018-09-30 20:06:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:42,839 INFO L93 Difference]: Finished difference Result 877 states and 2260 transitions. [2018-09-30 20:06:42,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:06:42,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:42,845 INFO L225 Difference]: With dead ends: 877 [2018-09-30 20:06:42,845 INFO L226 Difference]: Without dead ends: 871 [2018-09-30 20:06:42,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:06:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-09-30 20:06:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 478. [2018-09-30 20:06:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-09-30 20:06:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1531 transitions. [2018-09-30 20:06:42,935 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1531 transitions. Word has length 8 [2018-09-30 20:06:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:42,935 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 1531 transitions. [2018-09-30 20:06:42,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1531 transitions. [2018-09-30 20:06:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:42,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:42,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:42,937 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:42,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064444, now seen corresponding path program 1 times [2018-09-30 20:06:42,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:42,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:42,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:42,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:43,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:43,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:43,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:43,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:43,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:43,116 INFO L87 Difference]: Start difference. First operand 478 states and 1531 transitions. Second operand 8 states. [2018-09-30 20:06:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:45,133 INFO L93 Difference]: Finished difference Result 1049 states and 2854 transitions. [2018-09-30 20:06:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:06:45,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:45,139 INFO L225 Difference]: With dead ends: 1049 [2018-09-30 20:06:45,139 INFO L226 Difference]: Without dead ends: 818 [2018-09-30 20:06:45,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-09-30 20:06:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 524. [2018-09-30 20:06:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-09-30 20:06:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1684 transitions. [2018-09-30 20:06:45,248 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1684 transitions. Word has length 8 [2018-09-30 20:06:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:45,248 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 1684 transitions. [2018-09-30 20:06:45,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1684 transitions. [2018-09-30 20:06:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:45,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:45,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:45,251 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:45,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1663064441, now seen corresponding path program 1 times [2018-09-30 20:06:45,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:45,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:45,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:45,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:45,369 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:45,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:45,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:45,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:45,370 INFO L87 Difference]: Start difference. First operand 524 states and 1684 transitions. Second operand 8 states. [2018-09-30 20:06:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:46,960 INFO L93 Difference]: Finished difference Result 733 states and 1997 transitions. [2018-09-30 20:06:46,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:06:46,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:46,966 INFO L225 Difference]: With dead ends: 733 [2018-09-30 20:06:46,966 INFO L226 Difference]: Without dead ends: 727 [2018-09-30 20:06:46,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-09-30 20:06:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 530. [2018-09-30 20:06:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-09-30 20:06:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1690 transitions. [2018-09-30 20:06:47,084 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1690 transitions. Word has length 8 [2018-09-30 20:06:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:47,084 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 1690 transitions. [2018-09-30 20:06:47,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1690 transitions. [2018-09-30 20:06:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:47,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:47,086 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:47,087 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:47,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656691, now seen corresponding path program 1 times [2018-09-30 20:06:47,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:47,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:47,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:47,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:47,419 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-09-30 20:06:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:47,449 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:47,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:47,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:47,450 INFO L87 Difference]: Start difference. First operand 530 states and 1690 transitions. Second operand 8 states. [2018-09-30 20:06:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:50,663 INFO L93 Difference]: Finished difference Result 1329 states and 3609 transitions. [2018-09-30 20:06:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:06:50,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:50,672 INFO L225 Difference]: With dead ends: 1329 [2018-09-30 20:06:50,672 INFO L226 Difference]: Without dead ends: 1323 [2018-09-30 20:06:50,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:06:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-09-30 20:06:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 626. [2018-09-30 20:06:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-09-30 20:06:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2087 transitions. [2018-09-30 20:06:50,836 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 2087 transitions. Word has length 8 [2018-09-30 20:06:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:50,836 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 2087 transitions. [2018-09-30 20:06:50,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 2087 transitions. [2018-09-30 20:06:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:50,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:50,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:50,839 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:50,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:50,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1543656688, now seen corresponding path program 1 times [2018-09-30 20:06:50,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:50,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:50,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:50,946 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:50,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:50,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:50,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:50,948 INFO L87 Difference]: Start difference. First operand 626 states and 2087 transitions. Second operand 8 states. [2018-09-30 20:06:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:53,433 INFO L93 Difference]: Finished difference Result 1268 states and 3539 transitions. [2018-09-30 20:06:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:06:53,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:53,440 INFO L225 Difference]: With dead ends: 1268 [2018-09-30 20:06:53,441 INFO L226 Difference]: Without dead ends: 1262 [2018-09-30 20:06:53,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:06:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2018-09-30 20:06:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 618. [2018-09-30 20:06:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-09-30 20:06:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2056 transitions. [2018-09-30 20:06:53,601 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 2056 transitions. Word has length 8 [2018-09-30 20:06:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:53,602 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 2056 transitions. [2018-09-30 20:06:53,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 2056 transitions. [2018-09-30 20:06:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:53,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:53,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:53,604 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:53,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285639, now seen corresponding path program 1 times [2018-09-30 20:06:53,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:53,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:53,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:53,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:53,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:53,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:53,754 INFO L87 Difference]: Start difference. First operand 618 states and 2056 transitions. Second operand 8 states. [2018-09-30 20:06:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:56,184 INFO L93 Difference]: Finished difference Result 1367 states and 3876 transitions. [2018-09-30 20:06:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:06:56,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:56,193 INFO L225 Difference]: With dead ends: 1367 [2018-09-30 20:06:56,193 INFO L226 Difference]: Without dead ends: 1361 [2018-09-30 20:06:56,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:06:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-09-30 20:06:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 671. [2018-09-30 20:06:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-09-30 20:06:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2249 transitions. [2018-09-30 20:06:56,381 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2249 transitions. Word has length 8 [2018-09-30 20:06:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:56,381 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 2249 transitions. [2018-09-30 20:06:56,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2249 transitions. [2018-09-30 20:06:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:56,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:56,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:56,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:56,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:56,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1530285636, now seen corresponding path program 1 times [2018-09-30 20:06:56,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:56,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:56,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:56,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:06:56,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:56,494 INFO L87 Difference]: Start difference. First operand 671 states and 2249 transitions. Second operand 8 states. [2018-09-30 20:06:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:59,705 INFO L93 Difference]: Finished difference Result 1373 states and 3787 transitions. [2018-09-30 20:06:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:59,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:06:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:59,715 INFO L225 Difference]: With dead ends: 1373 [2018-09-30 20:06:59,715 INFO L226 Difference]: Without dead ends: 1367 [2018-09-30 20:06:59,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:06:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-09-30 20:06:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 698. [2018-09-30 20:06:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-09-30 20:06:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2344 transitions. [2018-09-30 20:06:59,934 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2344 transitions. Word has length 8 [2018-09-30 20:06:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:59,935 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 2344 transitions. [2018-09-30 20:06:59,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2344 transitions. [2018-09-30 20:06:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:06:59,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:59,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:59,937 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:59,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280348, now seen corresponding path program 1 times [2018-09-30 20:06:59,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:59,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:59,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:00,063 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:00,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:00,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:00,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:00,064 INFO L87 Difference]: Start difference. First operand 698 states and 2344 transitions. Second operand 7 states. [2018-09-30 20:07:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:02,137 INFO L93 Difference]: Finished difference Result 1526 states and 4298 transitions. [2018-09-30 20:07:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:07:02,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:02,147 INFO L225 Difference]: With dead ends: 1526 [2018-09-30 20:07:02,147 INFO L226 Difference]: Without dead ends: 1520 [2018-09-30 20:07:02,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2018-09-30 20:07:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 789. [2018-09-30 20:07:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-30 20:07:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2673 transitions. [2018-09-30 20:07:02,388 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 2673 transitions. Word has length 8 [2018-09-30 20:07:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:02,388 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 2673 transitions. [2018-09-30 20:07:02,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 2673 transitions. [2018-09-30 20:07:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:02,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:02,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:02,390 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:02,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1590280221, now seen corresponding path program 1 times [2018-09-30 20:07:02,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:02,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:02,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:02,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:02,489 INFO L87 Difference]: Start difference. First operand 789 states and 2673 transitions. Second operand 7 states. [2018-09-30 20:07:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:04,839 INFO L93 Difference]: Finished difference Result 1548 states and 4356 transitions. [2018-09-30 20:07:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:07:04,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:04,847 INFO L225 Difference]: With dead ends: 1548 [2018-09-30 20:07:04,847 INFO L226 Difference]: Without dead ends: 1542 [2018-09-30 20:07:04,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-09-30 20:07:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 821. [2018-09-30 20:07:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-30 20:07:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2801 transitions. [2018-09-30 20:07:05,068 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2801 transitions. Word has length 8 [2018-09-30 20:07:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:05,068 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 2801 transitions. [2018-09-30 20:07:05,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2801 transitions. [2018-09-30 20:07:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:05,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:05,069 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:05,070 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:05,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878937, now seen corresponding path program 1 times [2018-09-30 20:07:05,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:05,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:05,189 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:05,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:05,190 INFO L87 Difference]: Start difference. First operand 821 states and 2801 transitions. Second operand 7 states. [2018-09-30 20:07:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:07,487 INFO L93 Difference]: Finished difference Result 1575 states and 4539 transitions. [2018-09-30 20:07:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:07:07,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:07,495 INFO L225 Difference]: With dead ends: 1575 [2018-09-30 20:07:07,496 INFO L226 Difference]: Without dead ends: 1569 [2018-09-30 20:07:07,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-09-30 20:07:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 849. [2018-09-30 20:07:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-09-30 20:07:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2913 transitions. [2018-09-30 20:07:07,778 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2913 transitions. Word has length 8 [2018-09-30 20:07:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:07,779 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 2913 transitions. [2018-09-30 20:07:07,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2913 transitions. [2018-09-30 20:07:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:07,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:07,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:07,781 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:07,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:07,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1399878810, now seen corresponding path program 1 times [2018-09-30 20:07:07,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:07,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:07,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:07,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:07,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:07,878 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:07,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:07,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:07,879 INFO L87 Difference]: Start difference. First operand 849 states and 2913 transitions. Second operand 7 states. [2018-09-30 20:07:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:10,058 INFO L93 Difference]: Finished difference Result 1597 states and 4579 transitions. [2018-09-30 20:07:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:07:10,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:10,069 INFO L225 Difference]: With dead ends: 1597 [2018-09-30 20:07:10,069 INFO L226 Difference]: Without dead ends: 1591 [2018-09-30 20:07:10,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:07:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-30 20:07:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 873. [2018-09-30 20:07:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-09-30 20:07:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2993 transitions. [2018-09-30 20:07:10,336 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2993 transitions. Word has length 8 [2018-09-30 20:07:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:10,337 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 2993 transitions. [2018-09-30 20:07:10,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2993 transitions. [2018-09-30 20:07:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:10,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:10,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:10,339 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:10,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288024, now seen corresponding path program 1 times [2018-09-30 20:07:10,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:10,521 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:10,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:10,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:10,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:10,523 INFO L87 Difference]: Start difference. First operand 873 states and 2993 transitions. Second operand 7 states. [2018-09-30 20:07:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:12,639 INFO L93 Difference]: Finished difference Result 1726 states and 5211 transitions. [2018-09-30 20:07:12,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:07:12,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:12,650 INFO L225 Difference]: With dead ends: 1726 [2018-09-30 20:07:12,650 INFO L226 Difference]: Without dead ends: 1720 [2018-09-30 20:07:12,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:07:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2018-09-30 20:07:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1006. [2018-09-30 20:07:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2018-09-30 20:07:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3474 transitions. [2018-09-30 20:07:12,978 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3474 transitions. Word has length 8 [2018-09-30 20:07:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:12,978 INFO L480 AbstractCegarLoop]: Abstraction has 1006 states and 3474 transitions. [2018-09-30 20:07:12,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3474 transitions. [2018-09-30 20:07:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:12,979 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:12,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:12,980 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:12,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1719288027, now seen corresponding path program 1 times [2018-09-30 20:07:12,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:12,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:13,119 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:13,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:13,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:13,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:13,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:13,120 INFO L87 Difference]: Start difference. First operand 1006 states and 3474 transitions. Second operand 7 states. [2018-09-30 20:07:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:15,658 INFO L93 Difference]: Finished difference Result 1758 states and 5203 transitions. [2018-09-30 20:07:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:07:15,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:15,665 INFO L225 Difference]: With dead ends: 1758 [2018-09-30 20:07:15,666 INFO L226 Difference]: Without dead ends: 1752 [2018-09-30 20:07:15,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:07:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-09-30 20:07:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1011. [2018-09-30 20:07:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-09-30 20:07:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3493 transitions. [2018-09-30 20:07:16,028 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3493 transitions. Word has length 8 [2018-09-30 20:07:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:16,028 INFO L480 AbstractCegarLoop]: Abstraction has 1011 states and 3493 transitions. [2018-09-30 20:07:16,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3493 transitions. [2018-09-30 20:07:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:16,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:16,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:16,029 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:16,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746872, now seen corresponding path program 1 times [2018-09-30 20:07:16,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:16,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:16,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:16,125 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:16,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:16,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:16,126 INFO L87 Difference]: Start difference. First operand 1011 states and 3493 transitions. Second operand 7 states. [2018-09-30 20:07:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:19,027 INFO L93 Difference]: Finished difference Result 1867 states and 5608 transitions. [2018-09-30 20:07:19,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:07:19,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:19,033 INFO L225 Difference]: With dead ends: 1867 [2018-09-30 20:07:19,034 INFO L226 Difference]: Without dead ends: 1861 [2018-09-30 20:07:19,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2018-09-30 20:07:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1119. [2018-09-30 20:07:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-09-30 20:07:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 3931 transitions. [2018-09-30 20:07:19,443 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 3931 transitions. Word has length 8 [2018-09-30 20:07:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 1119 states and 3931 transitions. [2018-09-30 20:07:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 3931 transitions. [2018-09-30 20:07:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:19,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:19,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:19,445 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1726746875, now seen corresponding path program 1 times [2018-09-30 20:07:19,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:19,604 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:19,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:19,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:19,605 INFO L87 Difference]: Start difference. First operand 1119 states and 3931 transitions. Second operand 7 states. [2018-09-30 20:07:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:22,577 INFO L93 Difference]: Finished difference Result 1968 states and 5829 transitions. [2018-09-30 20:07:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:07:22,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:22,586 INFO L225 Difference]: With dead ends: 1968 [2018-09-30 20:07:22,586 INFO L226 Difference]: Without dead ends: 1962 [2018-09-30 20:07:22,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-09-30 20:07:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1111. [2018-09-30 20:07:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2018-09-30 20:07:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3891 transitions. [2018-09-30 20:07:23,129 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3891 transitions. Word has length 8 [2018-09-30 20:07:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:23,130 INFO L480 AbstractCegarLoop]: Abstraction has 1111 states and 3891 transitions. [2018-09-30 20:07:23,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3891 transitions. [2018-09-30 20:07:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:23,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:23,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:23,131 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:23,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1616407055, now seen corresponding path program 1 times [2018-09-30 20:07:23,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:23,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:23,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:23,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:23,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:23,233 INFO L87 Difference]: Start difference. First operand 1111 states and 3891 transitions. Second operand 7 states. [2018-09-30 20:07:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:26,009 INFO L93 Difference]: Finished difference Result 2001 states and 6001 transitions. [2018-09-30 20:07:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:07:26,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:26,019 INFO L225 Difference]: With dead ends: 2001 [2018-09-30 20:07:26,020 INFO L226 Difference]: Without dead ends: 1995 [2018-09-30 20:07:26,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-09-30 20:07:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1117. [2018-09-30 20:07:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-09-30 20:07:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 3909 transitions. [2018-09-30 20:07:26,525 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 3909 transitions. Word has length 8 [2018-09-30 20:07:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:26,525 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 3909 transitions. [2018-09-30 20:07:26,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 3909 transitions. [2018-09-30 20:07:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:26,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:26,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:26,526 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:26,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1616406928, now seen corresponding path program 1 times [2018-09-30 20:07:26,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:26,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:26,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:26,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:26,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:26,841 INFO L87 Difference]: Start difference. First operand 1117 states and 3909 transitions. Second operand 7 states. [2018-09-30 20:07:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:29,331 INFO L93 Difference]: Finished difference Result 1708 states and 5233 transitions. [2018-09-30 20:07:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:07:29,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:29,335 INFO L225 Difference]: With dead ends: 1708 [2018-09-30 20:07:29,336 INFO L226 Difference]: Without dead ends: 1702 [2018-09-30 20:07:29,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-09-30 20:07:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-09-30 20:07:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1210. [2018-09-30 20:07:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2018-09-30 20:07:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4307 transitions. [2018-09-30 20:07:29,807 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 4307 transitions. Word has length 8 [2018-09-30 20:07:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:29,807 INFO L480 AbstractCegarLoop]: Abstraction has 1210 states and 4307 transitions. [2018-09-30 20:07:29,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 4307 transitions. [2018-09-30 20:07:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:29,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:29,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:29,809 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:29,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256941, now seen corresponding path program 1 times [2018-09-30 20:07:29,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:29,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:29,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:29,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:29,906 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:29,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:29,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:29,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:29,907 INFO L87 Difference]: Start difference. First operand 1210 states and 4307 transitions. Second operand 7 states. [2018-09-30 20:07:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:33,246 INFO L93 Difference]: Finished difference Result 2402 states and 7321 transitions. [2018-09-30 20:07:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:07:33,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:33,254 INFO L225 Difference]: With dead ends: 2402 [2018-09-30 20:07:33,254 INFO L226 Difference]: Without dead ends: 2396 [2018-09-30 20:07:33,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2018-09-30 20:07:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1341. [2018-09-30 20:07:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-09-30 20:07:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 4862 transitions. [2018-09-30 20:07:33,867 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 4862 transitions. Word has length 8 [2018-09-30 20:07:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:33,867 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 4862 transitions. [2018-09-30 20:07:33,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 4862 transitions. [2018-09-30 20:07:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:33,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:33,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:33,869 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:33,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1621256944, now seen corresponding path program 1 times [2018-09-30 20:07:33,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:33,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:34,045 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:34,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:07:34,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:07:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:07:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:34,046 INFO L87 Difference]: Start difference. First operand 1341 states and 4862 transitions. Second operand 7 states. [2018-09-30 20:07:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:37,227 INFO L93 Difference]: Finished difference Result 2274 states and 6934 transitions. [2018-09-30 20:07:37,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:07:37,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:07:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:37,233 INFO L225 Difference]: With dead ends: 2274 [2018-09-30 20:07:37,233 INFO L226 Difference]: Without dead ends: 2268 [2018-09-30 20:07:37,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2018-09-30 20:07:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1337. [2018-09-30 20:07:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-09-30 20:07:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 4840 transitions. [2018-09-30 20:07:37,911 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 4840 transitions. Word has length 8 [2018-09-30 20:07:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:37,911 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 4840 transitions. [2018-09-30 20:07:37,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:07:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 4840 transitions. [2018-09-30 20:07:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:37,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:37,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:07:37,913 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:37,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1621267991, now seen corresponding path program 1 times [2018-09-30 20:07:37,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:37,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:37,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:37,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:07:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:07:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:07:37,951 INFO L87 Difference]: Start difference. First operand 1337 states and 4840 transitions. Second operand 4 states. [2018-09-30 20:07:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:38,904 INFO L93 Difference]: Finished difference Result 2170 states and 7637 transitions. [2018-09-30 20:07:38,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:07:38,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 20:07:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:38,908 INFO L225 Difference]: With dead ends: 2170 [2018-09-30 20:07:38,908 INFO L226 Difference]: Without dead ends: 1253 [2018-09-30 20:07:38,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:07:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-09-30 20:07:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1080. [2018-09-30 20:07:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-09-30 20:07:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3769 transitions. [2018-09-30 20:07:39,380 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3769 transitions. Word has length 8 [2018-09-30 20:07:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:39,380 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 3769 transitions. [2018-09-30 20:07:39,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:07:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3769 transitions. [2018-09-30 20:07:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:39,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:39,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:39,382 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:39,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283460, now seen corresponding path program 1 times [2018-09-30 20:07:39,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:39,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:39,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:39,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:39,544 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:39,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:07:39,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:39,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:39,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:39,545 INFO L87 Difference]: Start difference. First operand 1080 states and 3769 transitions. Second operand 8 states. [2018-09-30 20:07:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:43,227 INFO L93 Difference]: Finished difference Result 2095 states and 6316 transitions. [2018-09-30 20:07:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:07:43,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:07:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:43,230 INFO L225 Difference]: With dead ends: 2095 [2018-09-30 20:07:43,231 INFO L226 Difference]: Without dead ends: 2093 [2018-09-30 20:07:43,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:07:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-09-30 20:07:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1161. [2018-09-30 20:07:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2018-09-30 20:07:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 4123 transitions. [2018-09-30 20:07:43,726 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 4123 transitions. Word has length 8 [2018-09-30 20:07:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:43,726 INFO L480 AbstractCegarLoop]: Abstraction has 1161 states and 4123 transitions. [2018-09-30 20:07:43,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 4123 transitions. [2018-09-30 20:07:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:43,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:43,727 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:43,728 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:43,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2058283333, now seen corresponding path program 1 times [2018-09-30 20:07:43,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:43,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:43,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:43,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:07:43,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:43,901 INFO L87 Difference]: Start difference. First operand 1161 states and 4123 transitions. Second operand 8 states. [2018-09-30 20:07:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:47,659 INFO L93 Difference]: Finished difference Result 1994 states and 5988 transitions. [2018-09-30 20:07:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:07:47,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:07:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:47,663 INFO L225 Difference]: With dead ends: 1994 [2018-09-30 20:07:47,664 INFO L226 Difference]: Without dead ends: 1988 [2018-09-30 20:07:47,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:07:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-09-30 20:07:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1152. [2018-09-30 20:07:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-09-30 20:07:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 4099 transitions. [2018-09-30 20:07:48,294 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 4099 transitions. Word has length 8 [2018-09-30 20:07:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:48,295 INFO L480 AbstractCegarLoop]: Abstraction has 1152 states and 4099 transitions. [2018-09-30 20:07:48,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 4099 transitions. [2018-09-30 20:07:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:48,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:48,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:48,296 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:48,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1867882049, now seen corresponding path program 1 times [2018-09-30 20:07:48,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:48,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:48,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:48,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:07:48,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:48,411 INFO L87 Difference]: Start difference. First operand 1152 states and 4099 transitions. Second operand 8 states. [2018-09-30 20:07:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:52,688 INFO L93 Difference]: Finished difference Result 2160 states and 6516 transitions. [2018-09-30 20:07:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:07:52,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:07:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:52,692 INFO L225 Difference]: With dead ends: 2160 [2018-09-30 20:07:52,693 INFO L226 Difference]: Without dead ends: 2154 [2018-09-30 20:07:52,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:07:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2018-09-30 20:07:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1174. [2018-09-30 20:07:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-09-30 20:07:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4164 transitions. [2018-09-30 20:07:53,276 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 4164 transitions. Word has length 8 [2018-09-30 20:07:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:53,276 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 4164 transitions. [2018-09-30 20:07:53,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 4164 transitions. [2018-09-30 20:07:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:53,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:53,278 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:53,278 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:53,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1867881922, now seen corresponding path program 1 times [2018-09-30 20:07:53,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:53,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:53,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:53,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:07:53,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:07:53,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:07:53,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:07:53,407 INFO L87 Difference]: Start difference. First operand 1174 states and 4164 transitions. Second operand 8 states. [2018-09-30 20:07:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:57,602 INFO L93 Difference]: Finished difference Result 2094 states and 6271 transitions. [2018-09-30 20:07:57,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:07:57,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:07:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:57,607 INFO L225 Difference]: With dead ends: 2094 [2018-09-30 20:07:57,607 INFO L226 Difference]: Without dead ends: 2088 [2018-09-30 20:07:57,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:07:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-09-30 20:07:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1153. [2018-09-30 20:07:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-09-30 20:07:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 4095 transitions. [2018-09-30 20:07:58,220 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 4095 transitions. Word has length 8 [2018-09-30 20:07:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:58,220 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 4095 transitions. [2018-09-30 20:07:58,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:07:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 4095 transitions. [2018-09-30 20:07:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:07:58,221 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:58,221 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 20:07:58,222 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:58,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash -896988374, now seen corresponding path program 1 times [2018-09-30 20:07:58,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:58,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:58,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:58,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:58,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:07:58,341 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:58,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:58,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:07:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:07:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:07:58,342 INFO L87 Difference]: Start difference. First operand 1153 states and 4095 transitions. Second operand 4 states. [2018-09-30 20:07:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:59,459 INFO L93 Difference]: Finished difference Result 1929 states and 6604 transitions. [2018-09-30 20:07:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:07:59,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-09-30 20:07:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:59,462 INFO L225 Difference]: With dead ends: 1929 [2018-09-30 20:07:59,462 INFO L226 Difference]: Without dead ends: 1400 [2018-09-30 20:07:59,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:07:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2018-09-30 20:08:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1083. [2018-09-30 20:08:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2018-09-30 20:08:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3765 transitions. [2018-09-30 20:08:00,222 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 3765 transitions. Word has length 8 [2018-09-30 20:08:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:00,222 INFO L480 AbstractCegarLoop]: Abstraction has 1083 states and 3765 transitions. [2018-09-30 20:08:00,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:08:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 3765 transitions. [2018-09-30 20:08:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:00,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:00,223 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:00,223 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:00,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash -896379114, now seen corresponding path program 1 times [2018-09-30 20:08:00,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:00,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:00,728 WARN L178 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-09-30 20:08:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:00,874 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:00,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:00,876 INFO L87 Difference]: Start difference. First operand 1083 states and 3765 transitions. Second operand 8 states. [2018-09-30 20:08:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:04,535 INFO L93 Difference]: Finished difference Result 2276 states and 6948 transitions. [2018-09-30 20:08:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:08:04,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:04,540 INFO L225 Difference]: With dead ends: 2276 [2018-09-30 20:08:04,540 INFO L226 Difference]: Without dead ends: 2270 [2018-09-30 20:08:04,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:08:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2018-09-30 20:08:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1266. [2018-09-30 20:08:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-09-30 20:08:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4418 transitions. [2018-09-30 20:08:05,298 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4418 transitions. Word has length 8 [2018-09-30 20:08:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:05,299 INFO L480 AbstractCegarLoop]: Abstraction has 1266 states and 4418 transitions. [2018-09-30 20:08:05,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4418 transitions. [2018-09-30 20:08:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:05,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:05,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:05,301 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:05,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -896379111, now seen corresponding path program 1 times [2018-09-30 20:08:05,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:05,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:05,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:05,387 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:05,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:05,388 INFO L87 Difference]: Start difference. First operand 1266 states and 4418 transitions. Second operand 8 states. [2018-09-30 20:08:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:09,530 INFO L93 Difference]: Finished difference Result 2425 states and 7363 transitions. [2018-09-30 20:08:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:08:09,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:09,536 INFO L225 Difference]: With dead ends: 2425 [2018-09-30 20:08:09,537 INFO L226 Difference]: Without dead ends: 2419 [2018-09-30 20:08:09,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:08:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2018-09-30 20:08:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1373. [2018-09-30 20:08:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2018-09-30 20:08:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 4822 transitions. [2018-09-30 20:08:10,473 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 4822 transitions. Word has length 8 [2018-09-30 20:08:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:10,473 INFO L480 AbstractCegarLoop]: Abstraction has 1373 states and 4822 transitions. [2018-09-30 20:08:10,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 4822 transitions. [2018-09-30 20:08:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:10,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:10,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:10,475 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:10,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -881085998, now seen corresponding path program 1 times [2018-09-30 20:08:10,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:10,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:10,699 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-09-30 20:08:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:10,730 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:10,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:10,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:10,731 INFO L87 Difference]: Start difference. First operand 1373 states and 4822 transitions. Second operand 8 states. [2018-09-30 20:08:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:15,264 INFO L93 Difference]: Finished difference Result 2278 states and 6952 transitions. [2018-09-30 20:08:15,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:08:15,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:15,270 INFO L225 Difference]: With dead ends: 2278 [2018-09-30 20:08:15,270 INFO L226 Difference]: Without dead ends: 2272 [2018-09-30 20:08:15,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:08:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2018-09-30 20:08:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1421. [2018-09-30 20:08:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2018-09-30 20:08:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 4963 transitions. [2018-09-30 20:08:16,136 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 4963 transitions. Word has length 8 [2018-09-30 20:08:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:16,136 INFO L480 AbstractCegarLoop]: Abstraction has 1421 states and 4963 transitions. [2018-09-30 20:08:16,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 4963 transitions. [2018-09-30 20:08:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:16,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:16,137 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:16,137 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -881086125, now seen corresponding path program 1 times [2018-09-30 20:08:16,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:16,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:16,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:16,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:16,251 INFO L87 Difference]: Start difference. First operand 1421 states and 4963 transitions. Second operand 8 states. [2018-09-30 20:08:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:20,478 INFO L93 Difference]: Finished difference Result 2233 states and 6848 transitions. [2018-09-30 20:08:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:08:20,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:20,483 INFO L225 Difference]: With dead ends: 2233 [2018-09-30 20:08:20,483 INFO L226 Difference]: Without dead ends: 2227 [2018-09-30 20:08:20,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:08:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2018-09-30 20:08:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1411. [2018-09-30 20:08:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-09-30 20:08:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4926 transitions. [2018-09-30 20:08:21,465 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4926 transitions. Word has length 8 [2018-09-30 20:08:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:21,465 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 4926 transitions. [2018-09-30 20:08:21,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4926 transitions. [2018-09-30 20:08:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:21,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:21,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:21,466 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:21,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099334, now seen corresponding path program 1 times [2018-09-30 20:08:21,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:21,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:21,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:21,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:21,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:21,624 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:21,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:21,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:21,625 INFO L87 Difference]: Start difference. First operand 1411 states and 4926 transitions. Second operand 8 states. [2018-09-30 20:08:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:26,306 INFO L93 Difference]: Finished difference Result 2558 states and 7836 transitions. [2018-09-30 20:08:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:08:26,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:26,311 INFO L225 Difference]: With dead ends: 2558 [2018-09-30 20:08:26,311 INFO L226 Difference]: Without dead ends: 2552 [2018-09-30 20:08:26,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:08:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-09-30 20:08:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1471. [2018-09-30 20:08:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2018-09-30 20:08:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 5183 transitions. [2018-09-30 20:08:27,269 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 5183 transitions. Word has length 8 [2018-09-30 20:08:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:27,269 INFO L480 AbstractCegarLoop]: Abstraction has 1471 states and 5183 transitions. [2018-09-30 20:08:27,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 5183 transitions. [2018-09-30 20:08:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:27,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:27,271 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:27,271 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:27,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2077099337, now seen corresponding path program 1 times [2018-09-30 20:08:27,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:27,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:27,482 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:27,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:27,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:27,483 INFO L87 Difference]: Start difference. First operand 1471 states and 5183 transitions. Second operand 8 states. [2018-09-30 20:08:27,640 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-09-30 20:08:32,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:32,349 INFO L93 Difference]: Finished difference Result 2703 states and 8278 transitions. [2018-09-30 20:08:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:08:32,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:32,356 INFO L225 Difference]: With dead ends: 2703 [2018-09-30 20:08:32,356 INFO L226 Difference]: Without dead ends: 2697 [2018-09-30 20:08:32,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:08:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-09-30 20:08:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1480. [2018-09-30 20:08:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 20:08:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5200 transitions. [2018-09-30 20:08:33,397 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5200 transitions. Word has length 8 [2018-09-30 20:08:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:33,397 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5200 transitions. [2018-09-30 20:08:33,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5200 transitions. [2018-09-30 20:08:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:33,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:33,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:33,399 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:33,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:33,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629971, now seen corresponding path program 1 times [2018-09-30 20:08:33,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:33,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:33,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:33,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:33,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:33,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:33,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:33,537 INFO L87 Difference]: Start difference. First operand 1480 states and 5200 transitions. Second operand 8 states. [2018-09-30 20:08:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:38,750 INFO L93 Difference]: Finished difference Result 2674 states and 8171 transitions. [2018-09-30 20:08:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:08:38,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:38,759 INFO L225 Difference]: With dead ends: 2674 [2018-09-30 20:08:38,759 INFO L226 Difference]: Without dead ends: 2668 [2018-09-30 20:08:38,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:08:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2018-09-30 20:08:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 1480. [2018-09-30 20:08:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-09-30 20:08:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 5196 transitions. [2018-09-30 20:08:39,862 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 5196 transitions. Word has length 8 [2018-09-30 20:08:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:39,862 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 5196 transitions. [2018-09-30 20:08:39,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 5196 transitions. [2018-09-30 20:08:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:08:39,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:39,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:39,863 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:39,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1638629974, now seen corresponding path program 1 times [2018-09-30 20:08:39,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:39,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:39,981 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:39,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:39,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:39,982 INFO L87 Difference]: Start difference. First operand 1480 states and 5196 transitions. Second operand 8 states. [2018-09-30 20:08:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:45,519 INFO L93 Difference]: Finished difference Result 2722 states and 8299 transitions. [2018-09-30 20:08:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:08:45,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:08:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:45,525 INFO L225 Difference]: With dead ends: 2722 [2018-09-30 20:08:45,525 INFO L226 Difference]: Without dead ends: 2716 [2018-09-30 20:08:45,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:08:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2018-09-30 20:08:46,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 1462. [2018-09-30 20:08:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-09-30 20:08:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 5124 transitions. [2018-09-30 20:08:46,605 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 5124 transitions. Word has length 8 [2018-09-30 20:08:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:46,605 INFO L480 AbstractCegarLoop]: Abstraction has 1462 states and 5124 transitions. [2018-09-30 20:08:46,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 5124 transitions. [2018-09-30 20:08:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:08:46,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:46,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:46,606 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:46,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash 278041308, now seen corresponding path program 1 times [2018-09-30 20:08:46,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:46,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:46,827 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:46,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:46,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:46,828 INFO L87 Difference]: Start difference. First operand 1462 states and 5124 transitions. Second operand 8 states. [2018-09-30 20:08:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:51,875 INFO L93 Difference]: Finished difference Result 2962 states and 9218 transitions. [2018-09-30 20:08:51,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:08:51,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:08:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:51,881 INFO L225 Difference]: With dead ends: 2962 [2018-09-30 20:08:51,881 INFO L226 Difference]: Without dead ends: 2956 [2018-09-30 20:08:51,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:08:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-09-30 20:08:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1776. [2018-09-30 20:08:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-09-30 20:08:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 6236 transitions. [2018-09-30 20:08:53,226 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 6236 transitions. Word has length 9 [2018-09-30 20:08:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:53,226 INFO L480 AbstractCegarLoop]: Abstraction has 1776 states and 6236 transitions. [2018-09-30 20:08:53,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 6236 transitions. [2018-09-30 20:08:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:08:53,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:53,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:53,228 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:53,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:53,228 INFO L82 PathProgramCache]: Analyzing trace with hash 278041683, now seen corresponding path program 1 times [2018-09-30 20:08:53,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:53,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:53,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:53,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:53,327 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:53,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:53,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:53,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:53,328 INFO L87 Difference]: Start difference. First operand 1776 states and 6236 transitions. Second operand 8 states. [2018-09-30 20:08:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:58,431 INFO L93 Difference]: Finished difference Result 2948 states and 9162 transitions. [2018-09-30 20:08:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:08:58,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:08:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:58,438 INFO L225 Difference]: With dead ends: 2948 [2018-09-30 20:08:58,438 INFO L226 Difference]: Without dead ends: 2942 [2018-09-30 20:08:58,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:08:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2018-09-30 20:08:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1772. [2018-09-30 20:08:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-09-30 20:08:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 6220 transitions. [2018-09-30 20:08:59,883 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 6220 transitions. Word has length 9 [2018-09-30 20:08:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:59,883 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 6220 transitions. [2018-09-30 20:08:59,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:08:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 6220 transitions. [2018-09-30 20:08:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:08:59,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:59,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:59,884 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:59,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 541105076, now seen corresponding path program 1 times [2018-09-30 20:08:59,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:59,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:59,963 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:08:59,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:08:59,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:08:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:08:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:08:59,964 INFO L87 Difference]: Start difference. First operand 1772 states and 6220 transitions. Second operand 8 states. [2018-09-30 20:09:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:06,060 INFO L93 Difference]: Finished difference Result 3238 states and 9970 transitions. [2018-09-30 20:09:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:09:06,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:09:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:06,066 INFO L225 Difference]: With dead ends: 3238 [2018-09-30 20:09:06,067 INFO L226 Difference]: Without dead ends: 3232 [2018-09-30 20:09:06,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:09:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2018-09-30 20:09:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1799. [2018-09-30 20:09:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-09-30 20:09:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6288 transitions. [2018-09-30 20:09:07,502 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6288 transitions. Word has length 9 [2018-09-30 20:09:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:07,503 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 6288 transitions. [2018-09-30 20:09:07,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:09:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6288 transitions. [2018-09-30 20:09:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:07,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:07,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:07,504 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:07,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 541105451, now seen corresponding path program 1 times [2018-09-30 20:09:07,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:07,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:07,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:07,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:09:07,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:09:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:09:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:09:07,832 INFO L87 Difference]: Start difference. First operand 1799 states and 6288 transitions. Second operand 8 states. [2018-09-30 20:09:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:14,128 INFO L93 Difference]: Finished difference Result 3212 states and 9854 transitions. [2018-09-30 20:09:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:09:14,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:09:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:14,135 INFO L225 Difference]: With dead ends: 3212 [2018-09-30 20:09:14,135 INFO L226 Difference]: Without dead ends: 3206 [2018-09-30 20:09:14,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:09:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2018-09-30 20:09:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 1737. [2018-09-30 20:09:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-09-30 20:09:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 6062 transitions. [2018-09-30 20:09:15,701 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 6062 transitions. Word has length 9 [2018-09-30 20:09:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:15,701 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 6062 transitions. [2018-09-30 20:09:15,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:09:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 6062 transitions. [2018-09-30 20:09:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:15,702 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:15,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:15,702 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:15,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash 825189368, now seen corresponding path program 1 times [2018-09-30 20:09:15,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:15,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:15,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:15,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:15,783 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:15,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:09:15,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:09:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:09:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:09:15,784 INFO L87 Difference]: Start difference. First operand 1737 states and 6062 transitions. Second operand 8 states. [2018-09-30 20:09:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:21,503 INFO L93 Difference]: Finished difference Result 3315 states and 10043 transitions. [2018-09-30 20:09:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:09:21,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:09:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:21,510 INFO L225 Difference]: With dead ends: 3315 [2018-09-30 20:09:21,511 INFO L226 Difference]: Without dead ends: 3309 [2018-09-30 20:09:21,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:09:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2018-09-30 20:09:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1985. [2018-09-30 20:09:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2018-09-30 20:09:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 6886 transitions. [2018-09-30 20:09:23,337 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 6886 transitions. Word has length 9 [2018-09-30 20:09:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:23,337 INFO L480 AbstractCegarLoop]: Abstraction has 1985 states and 6886 transitions. [2018-09-30 20:09:23,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:09:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 6886 transitions. [2018-09-30 20:09:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:23,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:23,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:23,339 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:23,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 825189371, now seen corresponding path program 1 times [2018-09-30 20:09:23,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:23,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:23,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:23,441 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:23,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:09:23,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:09:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:09:23,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:09:23,442 INFO L87 Difference]: Start difference. First operand 1985 states and 6886 transitions. Second operand 8 states. [2018-09-30 20:09:29,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:29,850 INFO L93 Difference]: Finished difference Result 3446 states and 10415 transitions. [2018-09-30 20:09:29,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:09:29,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:09:29,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:29,857 INFO L225 Difference]: With dead ends: 3446 [2018-09-30 20:09:29,857 INFO L226 Difference]: Without dead ends: 3440 [2018-09-30 20:09:29,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:09:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2018-09-30 20:09:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 1927. [2018-09-30 20:09:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1927 states. [2018-09-30 20:09:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 6663 transitions. [2018-09-30 20:09:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 6663 transitions. Word has length 9 [2018-09-30 20:09:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 1927 states and 6663 transitions. [2018-09-30 20:09:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:09:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 6663 transitions. [2018-09-30 20:09:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:31,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:31,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:31,572 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash 832700792, now seen corresponding path program 1 times [2018-09-30 20:09:31,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:31,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:31,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:31,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:31,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:09:31,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:09:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:09:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:09:31,720 INFO L87 Difference]: Start difference. First operand 1927 states and 6663 transitions. Second operand 8 states. [2018-09-30 20:09:37,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:37,280 INFO L93 Difference]: Finished difference Result 2832 states and 8631 transitions. [2018-09-30 20:09:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:09:37,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:09:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:37,286 INFO L225 Difference]: With dead ends: 2832 [2018-09-30 20:09:37,286 INFO L226 Difference]: Without dead ends: 2824 [2018-09-30 20:09:37,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:09:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2018-09-30 20:09:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 1904. [2018-09-30 20:09:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-09-30 20:09:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 6553 transitions. [2018-09-30 20:09:39,032 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 6553 transitions. Word has length 9 [2018-09-30 20:09:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:39,033 INFO L480 AbstractCegarLoop]: Abstraction has 1904 states and 6553 transitions. [2018-09-30 20:09:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:09:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 6553 transitions. [2018-09-30 20:09:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:39,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:39,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:39,034 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:39,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash -595843680, now seen corresponding path program 1 times [2018-09-30 20:09:39,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:39,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:39,128 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:39,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:09:39,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:09:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:09:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:09:39,129 INFO L87 Difference]: Start difference. First operand 1904 states and 6553 transitions. Second operand 9 states. [2018-09-30 20:09:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:45,024 INFO L93 Difference]: Finished difference Result 3157 states and 9716 transitions. [2018-09-30 20:09:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:09:45,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 20:09:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:45,031 INFO L225 Difference]: With dead ends: 3157 [2018-09-30 20:09:45,031 INFO L226 Difference]: Without dead ends: 3151 [2018-09-30 20:09:45,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:09:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2018-09-30 20:09:46,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 1949. [2018-09-30 20:09:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2018-09-30 20:09:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 6722 transitions. [2018-09-30 20:09:46,932 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 6722 transitions. Word has length 9 [2018-09-30 20:09:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:46,932 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 6722 transitions. [2018-09-30 20:09:46,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:09:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 6722 transitions. [2018-09-30 20:09:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:46,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:46,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:46,934 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:46,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash -595843677, now seen corresponding path program 1 times [2018-09-30 20:09:46,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:47,098 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:47,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:09:47,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:09:47,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:09:47,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:09:47,099 INFO L87 Difference]: Start difference. First operand 1949 states and 6722 transitions. Second operand 9 states. [2018-09-30 20:09:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:55,699 INFO L93 Difference]: Finished difference Result 3822 states and 11523 transitions. [2018-09-30 20:09:55,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 20:09:55,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 20:09:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:55,707 INFO L225 Difference]: With dead ends: 3822 [2018-09-30 20:09:55,707 INFO L226 Difference]: Without dead ends: 3816 [2018-09-30 20:09:55,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=672, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:09:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2018-09-30 20:09:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2098. [2018-09-30 20:09:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-09-30 20:09:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 7405 transitions. [2018-09-30 20:09:57,824 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 7405 transitions. Word has length 9 [2018-09-30 20:09:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:57,824 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 7405 transitions. [2018-09-30 20:09:57,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:09:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 7405 transitions. [2018-09-30 20:09:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:09:57,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:57,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:57,826 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:57,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -204435682, now seen corresponding path program 1 times [2018-09-30 20:09:57,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:57,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:57,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:57,950 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:09:57,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:09:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:09:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:09:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:09:57,951 INFO L87 Difference]: Start difference. First operand 2098 states and 7405 transitions. Second operand 9 states. [2018-09-30 20:10:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:06,956 INFO L93 Difference]: Finished difference Result 4144 states and 12499 transitions. [2018-09-30 20:10:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:10:06,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 20:10:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:06,965 INFO L225 Difference]: With dead ends: 4144 [2018-09-30 20:10:06,965 INFO L226 Difference]: Without dead ends: 4138 [2018-09-30 20:10:06,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:10:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2018-09-30 20:10:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2260. [2018-09-30 20:10:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2018-09-30 20:10:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 7995 transitions. [2018-09-30 20:10:09,392 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 7995 transitions. Word has length 9 [2018-09-30 20:10:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:09,392 INFO L480 AbstractCegarLoop]: Abstraction has 2260 states and 7995 transitions. [2018-09-30 20:10:09,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:10:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 7995 transitions. [2018-09-30 20:10:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:10:09,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:09,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:09,394 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:09,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash -204435307, now seen corresponding path program 1 times [2018-09-30 20:10:09,394 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:09,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:09,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:10:09,552 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:10:09,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:10:09,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:10:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:10:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:10:09,553 INFO L87 Difference]: Start difference. First operand 2260 states and 7995 transitions. Second operand 9 states. [2018-09-30 20:10:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:16,717 INFO L93 Difference]: Finished difference Result 3320 states and 10163 transitions. [2018-09-30 20:10:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:10:16,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 20:10:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:16,724 INFO L225 Difference]: With dead ends: 3320 [2018-09-30 20:10:16,724 INFO L226 Difference]: Without dead ends: 3314 [2018-09-30 20:10:16,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:10:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2018-09-30 20:10:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2191. [2018-09-30 20:10:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2191 states. [2018-09-30 20:10:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 7721 transitions. [2018-09-30 20:10:19,133 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 7721 transitions. Word has length 9 [2018-09-30 20:10:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 2191 states and 7721 transitions. [2018-09-30 20:10:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:10:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 7721 transitions. [2018-09-30 20:10:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:10:19,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:19,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:19,135 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:19,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -966522519, now seen corresponding path program 1 times [2018-09-30 20:10:19,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:19,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:19,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:19,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:10:19,245 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:10:19,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:10:19,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:19,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:19,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:19,246 INFO L87 Difference]: Start difference. First operand 2191 states and 7721 transitions. Second operand 8 states. [2018-09-30 20:10:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:28,851 INFO L93 Difference]: Finished difference Result 4113 states and 13014 transitions. [2018-09-30 20:10:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:10:28,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-30 20:10:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:28,860 INFO L225 Difference]: With dead ends: 4113 [2018-09-30 20:10:28,860 INFO L226 Difference]: Without dead ends: 4107 [2018-09-30 20:10:28,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-09-30 20:10:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-09-30 20:10:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 2224. [2018-09-30 20:10:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-09-30 20:10:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 7857 transitions. [2018-09-30 20:10:31,274 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 7857 transitions. Word has length 9 [2018-09-30 20:10:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:31,275 INFO L480 AbstractCegarLoop]: Abstraction has 2224 states and 7857 transitions. [2018-09-30 20:10:31,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:10:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 7857 transitions. [2018-09-30 20:10:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:10:31,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:31,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:31,276 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr10ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:31,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -966522144, now seen corresponding path program 1 times [2018-09-30 20:10:31,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:31,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:31,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:31,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:10:31,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:10:31,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:10:31,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:31,375 INFO L87 Difference]: Start difference. First operand 2224 states and 7857 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 20:10:40,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:10:40,830 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:10:40,837 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:10:40,837 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:10:40 BoogieIcfgContainer [2018-09-30 20:10:40,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:10:40,839 INFO L168 Benchmark]: Toolchain (without parser) took 263608.34 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 71.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 20:10:40,840 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:40,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:40,841 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:10:40,842 INFO L168 Benchmark]: RCFGBuilder took 1287.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:40,843 INFO L168 Benchmark]: TraceAbstraction took 262226.74 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 20:10:40,847 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1287.28 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262226.74 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 28.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while BasicCegarLoop was constructing difference of abstraction (2224states) and FLOYD_HOARE automaton (currently 17 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (4244 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 262.1s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 213.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14983 SDtfs, 26642 SDslu, 28669 SDs, 0 SdLazy, 102898 SolverSat, 9517 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 821 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2260occurred in iteration=50, 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: 39.8s AutomataMinimizationTime, 52 MinimizatonAttempts, 43801 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 375 ConstructedInterpolants, 0 QuantifiedInterpolants, 25219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 6/6 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_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-10-40-862.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-10-40-862.csv Completed graceful shutdown