java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:24:46,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:24:46,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:24:46,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:24:46,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:24:46,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:24:46,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:24:46,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:24:46,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:24:46,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:24:46,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:24:46,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:24:46,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:24:46,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:24:46,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:24:46,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:24:46,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:24:46,240 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:24:46,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:24:46,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:24:46,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:24:46,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:24:46,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:24:46,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:24:46,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:24:46,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:24:46,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:24:46,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:24:46,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:24:46,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:24:46,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:24:46,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:24:46,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:24:46,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:24:46,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:24:46,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:24:46,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:24:46,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:24:46,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:24:46,299 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:24:46,299 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:24:46,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:24:46,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:24:46,301 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:24:46,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:24:46,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:24:46,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:24:46,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:24:46,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:24:46,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:24:46,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:24:46,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:24:46,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:24:46,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:24:46,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:24:46,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:24:46,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:24:46,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:24:46,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:24:46,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:46,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:24:46,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:24:46,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:24:46,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:24:46,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:24:46,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:24:46,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:24:46,305 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:24:46,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:24:46,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:24:46,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:24:46,392 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:24:46,393 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:24:46,394 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-10-01 00:24:46,394 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-10-01 00:24:46,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:24:46,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:24:46,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:46,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:24:46,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:24:46,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,529 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:24:46,529 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:24:46,529 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:24:46,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:24:46,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:24:46,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:24:46,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:24:46,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... [2018-10-01 00:24:46,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:24:46,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:24:46,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:24:46,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:24:46,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:24:46,662 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-01 00:24:46,662 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-01 00:24:46,663 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-01 00:24:47,577 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:24:47,578 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:47 BoogieIcfgContainer [2018-10-01 00:24:47,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:24:47,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:24:47,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:24:47,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:24:47,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:24:46" (1/2) ... [2018-10-01 00:24:47,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9acb2f and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:24:47, skipping insertion in model container [2018-10-01 00:24:47,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:24:47" (2/2) ... [2018-10-01 00:24:47,587 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-10-01 00:24:47,598 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:24:47,608 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-01 00:24:47,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:24:47,666 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:24:47,667 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:24:47,667 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:24:47,667 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:24:47,667 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:24:47,667 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:24:47,667 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:24:47,668 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:24:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-01 00:24:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:47,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:47,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:47,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:47,706 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-01 00:24:47,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:47,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:47,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-10-01 00:24:47,952 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:47,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:47,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:47,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:47,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:47,976 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-01 00:24:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:51,635 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-01 00:24:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:24:51,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:51,657 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:24:51,657 INFO L226 Difference]: Without dead ends: 158 [2018-10-01 00:24:51,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:24:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-01 00:24:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-01 00:24:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:24:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-01 00:24:51,717 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-01 00:24:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:51,718 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-01 00:24:51,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-01 00:24:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:24:51,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:51,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:51,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:51,722 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-01 00:24:51,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:51,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:51,793 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:51,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:24:51,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:24:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:24:51,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:51,796 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-01 00:24:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:54,166 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-01 00:24:54,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:24:54,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-01 00:24:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:54,171 INFO L225 Difference]: With dead ends: 188 [2018-10-01 00:24:54,171 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:24:54,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:24:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:24:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-01 00:24:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-01 00:24:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-01 00:24:54,211 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-01 00:24:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:54,211 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-01 00:24:54,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:24:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-01 00:24:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:24:54,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:54,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:54,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:54,215 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-01 00:24:54,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:54,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:54,332 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:54,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:54,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:54,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:54,333 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-01 00:24:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:24:57,610 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-10-01 00:24:57,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:24:57,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-01 00:24:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:24:57,615 INFO L225 Difference]: With dead ends: 283 [2018-10-01 00:24:57,615 INFO L226 Difference]: Without dead ends: 278 [2018-10-01 00:24:57,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:24:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-01 00:24:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-10-01 00:24:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:24:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-10-01 00:24:57,642 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-10-01 00:24:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:24:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-10-01 00:24:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:24:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-10-01 00:24:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:24:57,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:24:57,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:24:57,645 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:24:57,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:24:57,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-01 00:24:57,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:24:57,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:24:57,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:24:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:24:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:24:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:24:57,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:24:57,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-01 00:24:57,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:24:57,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:24:57,750 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:24:57,751 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-10-01 00:25:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:01,751 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-10-01 00:25:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:25:01,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-01 00:25:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:01,756 INFO L225 Difference]: With dead ends: 387 [2018-10-01 00:25:01,756 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:25:01,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:25:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-10-01 00:25:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-01 00:25:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-01 00:25:01,795 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-01 00:25:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:01,795 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-01 00:25:01,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-01 00:25:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:01,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:01,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:01,798 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:01,798 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-01 00:25:01,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:01,908 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:01,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:01,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:01,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:01,910 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:01,910 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-10-01 00:25:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:08,602 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-10-01 00:25:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:25:08,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:08,608 INFO L225 Difference]: With dead ends: 725 [2018-10-01 00:25:08,608 INFO L226 Difference]: Without dead ends: 717 [2018-10-01 00:25:08,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-10-01 00:25:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-10-01 00:25:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-01 00:25:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-10-01 00:25:08,670 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-10-01 00:25:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:08,671 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-10-01 00:25:08,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-10-01 00:25:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:08,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:08,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:08,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:08,674 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-01 00:25:08,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:08,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:08,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:08,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:08,834 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:08,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:08,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:08,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:08,836 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-10-01 00:25:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:18,973 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-10-01 00:25:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:25:18,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:18,983 INFO L225 Difference]: With dead ends: 1008 [2018-10-01 00:25:18,984 INFO L226 Difference]: Without dead ends: 1000 [2018-10-01 00:25:18,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-01 00:25:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-10-01 00:25:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-01 00:25:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-10-01 00:25:19,066 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-10-01 00:25:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:19,067 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-10-01 00:25:19,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-10-01 00:25:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:19,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:19,069 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:19,069 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:19,070 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-01 00:25:19,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:19,280 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:19,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:19,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:19,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:19,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:19,281 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-10-01 00:25:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:27,451 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-10-01 00:25:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:25:27,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:27,463 INFO L225 Difference]: With dead ends: 924 [2018-10-01 00:25:27,463 INFO L226 Difference]: Without dead ends: 916 [2018-10-01 00:25:27,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-01 00:25:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-10-01 00:25:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-01 00:25:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-10-01 00:25:27,552 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-10-01 00:25:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:27,553 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-10-01 00:25:27,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-10-01 00:25:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:27,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:27,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:27,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:27,555 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-01 00:25:27,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:27,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:27,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:27,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:27,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:27,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:27,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:27,704 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-10-01 00:25:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:34,346 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-10-01 00:25:34,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:25:34,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:34,353 INFO L225 Difference]: With dead ends: 791 [2018-10-01 00:25:34,353 INFO L226 Difference]: Without dead ends: 783 [2018-10-01 00:25:34,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:25:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-01 00:25:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-10-01 00:25:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-01 00:25:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-10-01 00:25:34,465 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-10-01 00:25:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:34,465 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-10-01 00:25:34,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-10-01 00:25:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:34,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:34,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:34,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:34,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-10-01 00:25:34,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:34,818 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:34,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:34,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:34,819 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:34,819 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-10-01 00:25:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:41,903 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-10-01 00:25:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:25:41,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:41,911 INFO L225 Difference]: With dead ends: 1040 [2018-10-01 00:25:41,912 INFO L226 Difference]: Without dead ends: 1032 [2018-10-01 00:25:41,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:25:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-01 00:25:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-10-01 00:25:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-01 00:25:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-10-01 00:25:42,045 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-10-01 00:25:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:42,046 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-10-01 00:25:42,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-10-01 00:25:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:42,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:42,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:42,048 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:42,048 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-10-01 00:25:42,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:42,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:42,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:42,153 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:42,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:42,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:42,154 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-10-01 00:25:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:50,378 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-10-01 00:25:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:25:50,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:50,385 INFO L225 Difference]: With dead ends: 1166 [2018-10-01 00:25:50,386 INFO L226 Difference]: Without dead ends: 1158 [2018-10-01 00:25:50,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:25:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-10-01 00:25:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-10-01 00:25:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-01 00:25:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-10-01 00:25:50,544 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-10-01 00:25:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:50,544 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-10-01 00:25:50,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-10-01 00:25:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:50,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:50,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:50,546 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:50,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-10-01 00:25:50,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:50,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:50,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:50,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:50,654 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:50,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:50,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:50,654 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:50,655 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-10-01 00:25:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:58,286 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-10-01 00:25:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:25:58,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:25:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:58,293 INFO L225 Difference]: With dead ends: 1127 [2018-10-01 00:25:58,293 INFO L226 Difference]: Without dead ends: 1119 [2018-10-01 00:25:58,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:25:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-01 00:25:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-10-01 00:25:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-01 00:25:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-10-01 00:25:58,476 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-10-01 00:25:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:58,476 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-10-01 00:25:58,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-10-01 00:25:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:58,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:58,477 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:25:58,478 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:58,478 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-10-01 00:25:58,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:58,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:58,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:25:58,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:58,663 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:58,663 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-10-01 00:26:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:05,962 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-10-01 00:26:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:05,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:05,968 INFO L225 Difference]: With dead ends: 975 [2018-10-01 00:26:05,968 INFO L226 Difference]: Without dead ends: 967 [2018-10-01 00:26:05,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-10-01 00:26:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-10-01 00:26:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-01 00:26:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-10-01 00:26:06,127 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-10-01 00:26:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:06,128 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-10-01 00:26:06,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-10-01 00:26:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:06,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:06,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:06,130 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:06,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-10-01 00:26:06,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:06,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:06,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:06,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:06,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:06,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:06,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:06,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:06,223 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-10-01 00:26:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:13,888 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-10-01 00:26:13,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:26:13,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:13,894 INFO L225 Difference]: With dead ends: 1011 [2018-10-01 00:26:13,894 INFO L226 Difference]: Without dead ends: 1003 [2018-10-01 00:26:13,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-10-01 00:26:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-10-01 00:26:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-01 00:26:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-10-01 00:26:14,074 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-10-01 00:26:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:14,075 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-10-01 00:26:14,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-10-01 00:26:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:14,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:14,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:14,076 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:14,076 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-10-01 00:26:14,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:14,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:14,176 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:14,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:14,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:26:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:26:14,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:14,177 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-10-01 00:26:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:20,359 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-10-01 00:26:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:26:20,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-01 00:26:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:20,364 INFO L225 Difference]: With dead ends: 859 [2018-10-01 00:26:20,364 INFO L226 Difference]: Without dead ends: 851 [2018-10-01 00:26:20,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-10-01 00:26:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-10-01 00:26:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:26:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-01 00:26:20,543 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-01 00:26:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:20,543 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-01 00:26:20,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:26:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-01 00:26:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:20,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:20,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:20,544 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:20,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-01 00:26:20,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:20,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:20,618 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:20,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:20,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:20,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:20,619 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-01 00:26:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:26,842 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-10-01 00:26:26,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:26:26,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:26,849 INFO L225 Difference]: With dead ends: 962 [2018-10-01 00:26:26,849 INFO L226 Difference]: Without dead ends: 954 [2018-10-01 00:26:26,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-01 00:26:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-10-01 00:26:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-01 00:26:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-10-01 00:26:27,093 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-10-01 00:26:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:27,093 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-10-01 00:26:27,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-10-01 00:26:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:27,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:27,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:27,095 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:27,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-10-01 00:26:27,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:27,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:27,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:27,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:27,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:27,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:27,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:27,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:27,178 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-10-01 00:26:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:34,254 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-10-01 00:26:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:26:34,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:34,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:34,260 INFO L225 Difference]: With dead ends: 1064 [2018-10-01 00:26:34,260 INFO L226 Difference]: Without dead ends: 1056 [2018-10-01 00:26:34,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:26:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-01 00:26:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-10-01 00:26:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-01 00:26:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-10-01 00:26:34,509 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-10-01 00:26:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:34,510 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-10-01 00:26:34,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-10-01 00:26:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:34,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:34,511 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:34,511 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:34,511 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-01 00:26:34,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:34,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:34,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:34,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:34,635 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:34,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:34,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:34,636 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:34,636 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-10-01 00:26:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:43,047 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-10-01 00:26:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:26:43,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:43,052 INFO L225 Difference]: With dead ends: 1241 [2018-10-01 00:26:43,052 INFO L226 Difference]: Without dead ends: 1233 [2018-10-01 00:26:43,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:26:43,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-01 00:26:43,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-10-01 00:26:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-01 00:26:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-10-01 00:26:43,385 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-10-01 00:26:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:43,385 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-10-01 00:26:43,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-10-01 00:26:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:43,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:43,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:43,387 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:43,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-10-01 00:26:43,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:43,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:43,454 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:43,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:43,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:43,455 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-10-01 00:26:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:49,528 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-10-01 00:26:49,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:26:49,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:49,535 INFO L225 Difference]: With dead ends: 1139 [2018-10-01 00:26:49,535 INFO L226 Difference]: Without dead ends: 1131 [2018-10-01 00:26:49,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:26:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-01 00:26:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-10-01 00:26:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-10-01 00:26:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-10-01 00:26:49,843 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-10-01 00:26:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:49,844 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-10-01 00:26:49,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-10-01 00:26:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:49,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:49,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:49,845 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:49,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-10-01 00:26:49,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:49,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:49,939 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:49,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:49,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:49,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:49,940 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-10-01 00:26:58,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:58,043 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-10-01 00:26:58,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:26:58,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:26:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:58,049 INFO L225 Difference]: With dead ends: 1325 [2018-10-01 00:26:58,049 INFO L226 Difference]: Without dead ends: 1317 [2018-10-01 00:26:58,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:26:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-10-01 00:26:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-10-01 00:26:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-01 00:26:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-10-01 00:26:58,364 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-10-01 00:26:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:58,364 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-10-01 00:26:58,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:26:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-10-01 00:26:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:26:58,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:58,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:26:58,365 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:58,365 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:58,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-01 00:26:58,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:58,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:58,439 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:26:58,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:26:58,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:26:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:26:58,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:58,440 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-10-01 00:27:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:06,725 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-10-01 00:27:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:27:06,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:27:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:06,731 INFO L225 Difference]: With dead ends: 1334 [2018-10-01 00:27:06,731 INFO L226 Difference]: Without dead ends: 1326 [2018-10-01 00:27:06,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-10-01 00:27:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-10-01 00:27:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-01 00:27:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-10-01 00:27:07,086 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-10-01 00:27:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-10-01 00:27:07,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-10-01 00:27:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:07,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:07,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:07,087 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:07,087 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-10-01 00:27:07,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:07,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:07,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:07,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:07,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:07,178 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-10-01 00:27:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:12,063 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-10-01 00:27:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:27:12,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:27:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:12,068 INFO L225 Difference]: With dead ends: 919 [2018-10-01 00:27:12,068 INFO L226 Difference]: Without dead ends: 911 [2018-10-01 00:27:12,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-10-01 00:27:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-10-01 00:27:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-01 00:27:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-10-01 00:27:12,400 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-10-01 00:27:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:12,400 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-10-01 00:27:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-10-01 00:27:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:12,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:12,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:12,401 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:12,402 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-10-01 00:27:12,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:12,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:12,488 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:12,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:12,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:12,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:12,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:12,489 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-10-01 00:27:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:19,061 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-10-01 00:27:19,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:27:19,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:27:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:19,068 INFO L225 Difference]: With dead ends: 1095 [2018-10-01 00:27:19,069 INFO L226 Difference]: Without dead ends: 1087 [2018-10-01 00:27:19,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-10-01 00:27:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-10-01 00:27:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-01 00:27:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-10-01 00:27:19,443 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-10-01 00:27:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-10-01 00:27:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-10-01 00:27:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:19,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:19,444 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:19,445 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:19,445 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-10-01 00:27:19,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:19,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:19,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:19,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:19,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:19,526 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:19,526 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-10-01 00:27:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:28,305 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-10-01 00:27:28,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:27:28,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:27:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:28,309 INFO L225 Difference]: With dead ends: 1304 [2018-10-01 00:27:28,309 INFO L226 Difference]: Without dead ends: 1296 [2018-10-01 00:27:28,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-01 00:27:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-10-01 00:27:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-10-01 00:27:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-10-01 00:27:28,677 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-10-01 00:27:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-10-01 00:27:28,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-10-01 00:27:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:27:28,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:28,679 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:28,679 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:28,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-01 00:27:28,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:28,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-10-01 00:27:28,751 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:28,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:28,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:28,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:28,752 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-10-01 00:27:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:36,373 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-10-01 00:27:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:27:36,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:27:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:36,376 INFO L225 Difference]: With dead ends: 1192 [2018-10-01 00:27:36,376 INFO L226 Difference]: Without dead ends: 1184 [2018-10-01 00:27:36,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:27:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-01 00:27:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-10-01 00:27:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-01 00:27:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-01 00:27:36,830 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-01 00:27:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:36,830 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-01 00:27:36,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:27:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-01 00:27:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:36,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:36,831 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:36,831 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:36,831 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-10-01 00:27:36,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:36,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:36,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:36,872 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:36,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:36,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:36,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:36,873 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-01 00:27:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:38,022 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-10-01 00:27:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:38,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-01 00:27:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:38,024 INFO L225 Difference]: With dead ends: 1139 [2018-10-01 00:27:38,024 INFO L226 Difference]: Without dead ends: 625 [2018-10-01 00:27:38,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-01 00:27:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-10-01 00:27:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-01 00:27:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-10-01 00:27:38,535 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-10-01 00:27:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:38,535 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-10-01 00:27:38,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-10-01 00:27:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:38,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:38,536 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:38,537 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:38,537 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-10-01 00:27:38,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:38,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:38,651 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:38,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:38,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:38,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:39,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:39,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-01 00:27:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:27:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:27:39,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:39,669 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-10-01 00:27:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:48,796 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-10-01 00:27:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:27:48,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-01 00:27:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:48,798 INFO L225 Difference]: With dead ends: 794 [2018-10-01 00:27:48,798 INFO L226 Difference]: Without dead ends: 789 [2018-10-01 00:27:48,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:27:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-01 00:27:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-10-01 00:27:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-01 00:27:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-10-01 00:27:49,445 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-10-01 00:27:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:49,445 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-10-01 00:27:49,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:27:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-10-01 00:27:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:27:49,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:49,446 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:49,446 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:49,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-10-01 00:27:49,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:49,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:49,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:49,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-01 00:27:49,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:27:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:27:49,494 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:49,494 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-10-01 00:27:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:51,114 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-10-01 00:27:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:27:51,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-01 00:27:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:51,117 INFO L225 Difference]: With dead ends: 1317 [2018-10-01 00:27:51,117 INFO L226 Difference]: Without dead ends: 729 [2018-10-01 00:27:51,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:27:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-01 00:27:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-10-01 00:27:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-01 00:27:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-01 00:27:51,754 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-01 00:27:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:51,754 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-01 00:27:51,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:27:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-01 00:27:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:27:51,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:51,755 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:27:51,756 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:51,756 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-10-01 00:27:51,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:51,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:51,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:51,938 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:27:51,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:27:51,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:27:51,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:27:51,938 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:51,939 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-10-01 00:27:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:59,345 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-10-01 00:27:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:27:59,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:27:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:59,348 INFO L225 Difference]: With dead ends: 1435 [2018-10-01 00:27:59,348 INFO L226 Difference]: Without dead ends: 1427 [2018-10-01 00:27:59,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:27:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-10-01 00:28:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-10-01 00:28:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-10-01 00:28:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-10-01 00:28:00,144 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-10-01 00:28:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:00,144 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-10-01 00:28:00,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-10-01 00:28:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:00,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:00,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:00,146 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:00,146 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-10-01 00:28:00,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:00,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:00,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:00,322 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:00,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:28:00,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:00,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:00,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:00,323 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-10-01 00:28:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:08,289 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-10-01 00:28:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:28:08,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:08,294 INFO L225 Difference]: With dead ends: 1599 [2018-10-01 00:28:08,294 INFO L226 Difference]: Without dead ends: 1591 [2018-10-01 00:28:08,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:28:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-01 00:28:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-10-01 00:28:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-01 00:28:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-10-01 00:28:09,071 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-10-01 00:28:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:09,071 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-10-01 00:28:09,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-10-01 00:28:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:09,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:09,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:09,073 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:09,073 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-10-01 00:28:09,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:09,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:09,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:09,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:09,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:09,154 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:09,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:28:09,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:09,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:09,155 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-10-01 00:28:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:15,847 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-10-01 00:28:15,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:28:15,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:15,851 INFO L225 Difference]: With dead ends: 1411 [2018-10-01 00:28:15,852 INFO L226 Difference]: Without dead ends: 1403 [2018-10-01 00:28:15,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:28:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-01 00:28:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-10-01 00:28:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-01 00:28:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-10-01 00:28:16,676 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-10-01 00:28:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:16,677 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-10-01 00:28:16,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-10-01 00:28:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:16,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:16,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:16,678 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:16,678 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-10-01 00:28:16,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:16,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:16,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:16,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:16,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:16,753 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:16,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:28:16,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:16,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:16,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:16,754 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-10-01 00:28:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:24,269 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-10-01 00:28:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:28:24,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:24,271 INFO L225 Difference]: With dead ends: 1490 [2018-10-01 00:28:24,271 INFO L226 Difference]: Without dead ends: 1482 [2018-10-01 00:28:24,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:28:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-01 00:28:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-10-01 00:28:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-01 00:28:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-10-01 00:28:25,109 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-10-01 00:28:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:25,110 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-10-01 00:28:25,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-10-01 00:28:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:25,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:25,110 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:25,111 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:25,111 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-10-01 00:28:25,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:25,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:25,203 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:25,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:28:25,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:25,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:25,204 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-10-01 00:28:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:32,384 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-10-01 00:28:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:28:32,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:32,386 INFO L225 Difference]: With dead ends: 1427 [2018-10-01 00:28:32,387 INFO L226 Difference]: Without dead ends: 1419 [2018-10-01 00:28:32,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:28:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-01 00:28:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-10-01 00:28:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-01 00:28:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-10-01 00:28:33,275 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-10-01 00:28:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:33,275 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-10-01 00:28:33,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-10-01 00:28:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:33,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:33,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:33,277 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:33,277 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-10-01 00:28:33,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:33,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:33,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:28:33,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-01 00:28:33,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:33,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:33,359 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-10-01 00:28:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:39,993 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-10-01 00:28:39,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:28:39,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:39,995 INFO L225 Difference]: With dead ends: 1306 [2018-10-01 00:28:39,995 INFO L226 Difference]: Without dead ends: 1298 [2018-10-01 00:28:39,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:28:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-01 00:28:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-10-01 00:28:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-01 00:28:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-10-01 00:28:40,929 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-10-01 00:28:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:40,929 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-10-01 00:28:40,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-10-01 00:28:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:40,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:40,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:40,930 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:40,930 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-10-01 00:28:40,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:40,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:40,994 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:40,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:41,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:41,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:41,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:28:41,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:41,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:41,086 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-10-01 00:28:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:47,144 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-10-01 00:28:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:28:47,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:47,146 INFO L225 Difference]: With dead ends: 1285 [2018-10-01 00:28:47,146 INFO L226 Difference]: Without dead ends: 1277 [2018-10-01 00:28:47,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:28:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-01 00:28:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-10-01 00:28:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-01 00:28:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-10-01 00:28:48,097 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-10-01 00:28:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:48,097 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-10-01 00:28:48,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:48,097 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-10-01 00:28:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:48,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:48,098 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:48,098 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:48,098 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-10-01 00:28:48,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:48,186 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:48,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:48,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:48,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:48,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:48,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:28:48,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:48,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:48,273 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-10-01 00:28:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:55,941 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-10-01 00:28:55,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:28:55,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:28:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:55,943 INFO L225 Difference]: With dead ends: 1518 [2018-10-01 00:28:55,943 INFO L226 Difference]: Without dead ends: 1510 [2018-10-01 00:28:55,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:28:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-10-01 00:28:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-10-01 00:28:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-01 00:28:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-10-01 00:28:56,990 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-10-01 00:28:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:56,991 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-10-01 00:28:56,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:28:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-10-01 00:28:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:28:56,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:56,991 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:28:56,992 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:56,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-10-01 00:28:56,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:56,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:57,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:57,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:57,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:57,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:28:57,206 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:57,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:28:57,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:28:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:28:57,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:57,207 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-10-01 00:29:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:04,740 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-10-01 00:29:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:29:04,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:29:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:04,742 INFO L225 Difference]: With dead ends: 1448 [2018-10-01 00:29:04,742 INFO L226 Difference]: Without dead ends: 1440 [2018-10-01 00:29:04,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:29:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-01 00:29:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-10-01 00:29:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-10-01 00:29:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-10-01 00:29:05,698 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-10-01 00:29:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:05,699 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-10-01 00:29:05,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-10-01 00:29:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:05,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:05,700 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:05,700 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:05,700 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-10-01 00:29:05,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:05,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:05,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:29:06,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:06,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:06,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:06,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:29:06,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:06,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:29:06,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:29:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:29:06,638 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:06,638 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-10-01 00:29:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:12,839 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-10-01 00:29:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:29:12,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-10-01 00:29:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:12,841 INFO L225 Difference]: With dead ends: 1254 [2018-10-01 00:29:12,841 INFO L226 Difference]: Without dead ends: 1246 [2018-10-01 00:29:12,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:29:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-10-01 00:29:13,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-10-01 00:29:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-10-01 00:29:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-10-01 00:29:13,820 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-10-01 00:29:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:13,820 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-10-01 00:29:13,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:29:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-10-01 00:29:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:13,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:13,821 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:13,822 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:13,822 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-10-01 00:29:13,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:13,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:13,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:14,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:14,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:14,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:14,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:29:14,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:29:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:29:14,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:14,373 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-10-01 00:29:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:32,121 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-10-01 00:29:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:29:32,121 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:29:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:32,123 INFO L225 Difference]: With dead ends: 1278 [2018-10-01 00:29:32,123 INFO L226 Difference]: Without dead ends: 1270 [2018-10-01 00:29:32,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:29:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-10-01 00:29:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-10-01 00:29:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-10-01 00:29:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-10-01 00:29:33,210 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-10-01 00:29:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:33,210 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-10-01 00:29:33,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:29:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-10-01 00:29:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:33,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:33,211 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:33,211 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:33,212 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-10-01 00:29:33,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:33,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:33,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:33,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:33,292 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:33,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-01 00:29:33,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:29:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:29:33,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:33,293 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-10-01 00:29:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:41,336 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-10-01 00:29:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:29:41,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:29:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:41,338 INFO L225 Difference]: With dead ends: 1180 [2018-10-01 00:29:41,338 INFO L226 Difference]: Without dead ends: 1172 [2018-10-01 00:29:41,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:29:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-10-01 00:29:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-10-01 00:29:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-10-01 00:29:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-10-01 00:29:42,328 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-10-01 00:29:42,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:42,328 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-10-01 00:29:42,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:29:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-10-01 00:29:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:42,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:42,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:42,329 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:42,329 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-10-01 00:29:42,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:42,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:42,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:42,754 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:42,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-01 00:29:42,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:29:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:29:42,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:42,755 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-10-01 00:29:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:51,744 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-10-01 00:29:51,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:29:51,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:29:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:51,745 INFO L225 Difference]: With dead ends: 1233 [2018-10-01 00:29:51,746 INFO L226 Difference]: Without dead ends: 1225 [2018-10-01 00:29:51,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:29:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-10-01 00:29:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-10-01 00:29:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-01 00:29:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-10-01 00:29:52,796 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-10-01 00:29:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:52,797 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-10-01 00:29:52,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:29:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-10-01 00:29:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:29:52,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:52,798 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:29:52,798 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:52,798 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-10-01 00:29:52,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:52,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:52,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-10-01 00:29:52,875 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:29:52,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-01 00:29:52,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:29:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:29:52,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:52,876 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-10-01 00:30:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:03,293 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-10-01 00:30:03,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:30:03,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:30:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:03,295 INFO L225 Difference]: With dead ends: 1537 [2018-10-01 00:30:03,295 INFO L226 Difference]: Without dead ends: 1529 [2018-10-01 00:30:03,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:30:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-01 00:30:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-10-01 00:30:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-01 00:30:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-10-01 00:30:04,488 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-10-01 00:30:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:04,489 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-10-01 00:30:04,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:30:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-10-01 00:30:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:30:04,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:04,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:04,490 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:04,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-10-01 00:30:04,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:04,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:04,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:04,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:04,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:04,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-01 00:30:04,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:30:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:30:04,628 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:04,628 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-10-01 00:30:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:16,257 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-10-01 00:30:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:30:16,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:30:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:16,259 INFO L225 Difference]: With dead ends: 1590 [2018-10-01 00:30:16,260 INFO L226 Difference]: Without dead ends: 1582 [2018-10-01 00:30:16,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:30:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-10-01 00:30:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-10-01 00:30:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-10-01 00:30:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-10-01 00:30:17,377 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-10-01 00:30:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:17,377 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-10-01 00:30:17,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:30:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-10-01 00:30:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:30:17,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:17,377 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:17,378 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:17,378 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-10-01 00:30:17,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:17,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:17,459 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:17,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:17,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:17,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:17,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:30:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:30:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:30:17,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:17,642 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-10-01 00:30:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:49,815 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-10-01 00:30:49,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:30:49,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:30:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:49,818 INFO L225 Difference]: With dead ends: 1949 [2018-10-01 00:30:49,818 INFO L226 Difference]: Without dead ends: 1941 [2018-10-01 00:30:49,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:30:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-10-01 00:30:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-10-01 00:30:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-10-01 00:30:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-10-01 00:30:51,088 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-10-01 00:30:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:51,089 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-10-01 00:30:51,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:30:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-10-01 00:30:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:30:51,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:51,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:30:51,090 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:51,090 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-10-01 00:30:51,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:51,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:51,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:30:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:51,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:30:51,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-01 00:30:51,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:30:51,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:30:51,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:51,206 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-10-01 00:31:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:00,848 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-10-01 00:31:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:31:00,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:31:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:00,850 INFO L225 Difference]: With dead ends: 1420 [2018-10-01 00:31:00,850 INFO L226 Difference]: Without dead ends: 1412 [2018-10-01 00:31:00,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:31:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-10-01 00:31:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-10-01 00:31:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-10-01 00:31:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-10-01 00:31:02,119 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-10-01 00:31:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:02,119 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-10-01 00:31:02,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:31:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-10-01 00:31:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:31:02,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:02,120 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:02,120 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:02,120 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-10-01 00:31:02,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:02,200 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:02,200 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:02,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:02,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:02,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:31:02,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:31:02,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:31:02,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:02,416 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-10-01 00:31:44,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:44,386 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-10-01 00:31:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-01 00:31:44,387 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:31:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:44,390 INFO L225 Difference]: With dead ends: 2767 [2018-10-01 00:31:44,390 INFO L226 Difference]: Without dead ends: 2759 [2018-10-01 00:31:44,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s Time [2018-10-01 00:31:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-01 00:31:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-10-01 00:31:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-01 00:31:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-10-01 00:31:45,750 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-10-01 00:31:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:45,751 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-10-01 00:31:45,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:31:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-10-01 00:31:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:31:45,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:45,752 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:31:45,752 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:45,752 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-10-01 00:31:45,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:45,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:45,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:45,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:45,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:45,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:45,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:46,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:46,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-01 00:31:46,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:31:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:31:46,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:46,055 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-10-01 00:32:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:26,451 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-10-01 00:32:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-01 00:32:26,452 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:32:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:26,454 INFO L225 Difference]: With dead ends: 2361 [2018-10-01 00:32:26,454 INFO L226 Difference]: Without dead ends: 2353 [2018-10-01 00:32:26,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s Time [2018-10-01 00:32:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-10-01 00:32:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-10-01 00:32:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-01 00:32:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-10-01 00:32:28,074 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-10-01 00:32:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:28,075 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-10-01 00:32:28,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:32:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-10-01 00:32:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:32:28,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:28,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:28,076 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:28,076 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-10-01 00:32:28,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:28,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:28,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:28,210 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:28,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:28,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:28,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:28,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:28,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-01 00:32:28,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:32:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:32:28,348 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:28,348 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-10-01 00:32:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:33,414 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-10-01 00:32:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:32:33,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-10-01 00:32:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:33,415 INFO L225 Difference]: With dead ends: 1507 [2018-10-01 00:32:33,415 INFO L226 Difference]: Without dead ends: 1502 [2018-10-01 00:32:33,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:32:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-01 00:32:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-10-01 00:32:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-10-01 00:32:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-10-01 00:32:35,215 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-10-01 00:32:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:35,216 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-10-01 00:32:35,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:32:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-10-01 00:32:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:32:35,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:35,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:35,217 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:35,217 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-10-01 00:32:35,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:35,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:35,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:35,351 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:35,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:35,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:35,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-01 00:32:35,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:32:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:32:35,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:35,536 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-10-01 00:32:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:56,470 INFO L93 Difference]: Finished difference Result 3662 states and 8082 transitions. [2018-10-01 00:32:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:32:56,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-10-01 00:32:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:56,474 INFO L225 Difference]: With dead ends: 3662 [2018-10-01 00:32:56,474 INFO L226 Difference]: Without dead ends: 3654 [2018-10-01 00:32:56,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:32:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2018-10-01 00:32:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 2136. [2018-10-01 00:32:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-01 00:32:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-10-01 00:32:59,347 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-10-01 00:32:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:59,348 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-10-01 00:32:59,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:32:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-10-01 00:32:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:32:59,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:59,349 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:32:59,349 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:59,349 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-10-01 00:32:59,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:59,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:59,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:32:59,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:59,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:59,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:32:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:59,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:32:59,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:59,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:32:59,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:32:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:32:59,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:59,599 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-10-01 00:33:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:08,316 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-10-01 00:33:08,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:33:08,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:33:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:08,319 INFO L225 Difference]: With dead ends: 2767 [2018-10-01 00:33:08,319 INFO L226 Difference]: Without dead ends: 2759 [2018-10-01 00:33:08,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:33:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-10-01 00:33:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-10-01 00:33:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-10-01 00:33:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-10-01 00:33:11,183 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-10-01 00:33:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:11,184 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-10-01 00:33:11,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:33:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-10-01 00:33:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:33:11,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:11,185 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:11,185 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:11,185 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-10-01 00:33:11,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:11,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:11,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:11,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:11,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:11,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:11,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:11,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:11,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:33:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:33:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:33:11,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:11,428 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-10-01 00:33:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:21,522 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-10-01 00:33:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:33:21,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:33:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:21,526 INFO L225 Difference]: With dead ends: 3146 [2018-10-01 00:33:21,526 INFO L226 Difference]: Without dead ends: 3138 [2018-10-01 00:33:21,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:33:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-10-01 00:33:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-10-01 00:33:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-10-01 00:33:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-10-01 00:33:24,632 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-10-01 00:33:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:24,632 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-10-01 00:33:24,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:33:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-10-01 00:33:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:33:24,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:24,633 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:24,634 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:24,634 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-10-01 00:33:24,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:24,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:24,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:24,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:24,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:24,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:33:24,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:33:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:33:24,976 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:24,976 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-10-01 00:33:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:35,619 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-10-01 00:33:35,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:33:35,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:33:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:35,623 INFO L225 Difference]: With dead ends: 3089 [2018-10-01 00:33:35,623 INFO L226 Difference]: Without dead ends: 3081 [2018-10-01 00:33:35,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:33:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-01 00:33:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-10-01 00:33:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-01 00:33:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-10-01 00:33:38,740 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-10-01 00:33:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:38,740 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-10-01 00:33:38,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:33:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-10-01 00:33:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:33:38,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:38,742 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:38,742 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:38,742 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-10-01 00:33:38,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:38,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:38,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:38,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:38,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:38,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:38,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:38,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:38,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:33:38,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:33:38,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:33:38,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:38,927 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-10-01 00:33:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:49,388 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-10-01 00:33:49,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:33:49,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:33:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:49,392 INFO L225 Difference]: With dead ends: 3266 [2018-10-01 00:33:49,393 INFO L226 Difference]: Without dead ends: 3258 [2018-10-01 00:33:49,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:33:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-10-01 00:33:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-10-01 00:33:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-10-01 00:33:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-10-01 00:33:52,582 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-10-01 00:33:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:52,582 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-10-01 00:33:52,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:33:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-10-01 00:33:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:33:52,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:52,583 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:33:52,584 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:52,584 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-10-01 00:33:52,584 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:52,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:52,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:52,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:52,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:33:52,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:52,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:33:52,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:33:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:33:52,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:52,884 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. [2018-10-01 00:34:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:05,494 INFO L93 Difference]: Finished difference Result 3498 states and 7776 transitions. [2018-10-01 00:34:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:34:05,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:34:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:05,498 INFO L225 Difference]: With dead ends: 3498 [2018-10-01 00:34:05,499 INFO L226 Difference]: Without dead ends: 3490 [2018-10-01 00:34:05,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:34:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2018-10-01 00:34:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2262. [2018-10-01 00:34:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-10-01 00:34:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-10-01 00:34:08,727 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-10-01 00:34:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:08,728 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-10-01 00:34:08,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:34:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-10-01 00:34:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:34:08,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:08,729 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:08,729 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:08,729 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash 826825729, now seen corresponding path program 1 times [2018-10-01 00:34:08,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:08,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:09,031 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:09,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:09,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:09,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:09,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:09,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:34:09,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:34:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:34:09,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:09,107 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-10-01 00:34:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:20,047 INFO L93 Difference]: Finished difference Result 3139 states and 7021 transitions. [2018-10-01 00:34:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:34:20,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:34:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:20,051 INFO L225 Difference]: With dead ends: 3139 [2018-10-01 00:34:20,051 INFO L226 Difference]: Without dead ends: 3131 [2018-10-01 00:34:20,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:34:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2018-10-01 00:34:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2262. [2018-10-01 00:34:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-10-01 00:34:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5119 transitions. [2018-10-01 00:34:23,226 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5119 transitions. Word has length 20 [2018-10-01 00:34:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:23,226 INFO L480 AbstractCegarLoop]: Abstraction has 2262 states and 5119 transitions. [2018-10-01 00:34:23,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:34:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5119 transitions. [2018-10-01 00:34:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:34:23,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:23,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:23,228 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:23,228 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1854611284, now seen corresponding path program 1 times [2018-10-01 00:34:23,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:23,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:23,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:23,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:23,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:23,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:23,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:23,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:23,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:34:23,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:34:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:34:23,584 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:23,584 INFO L87 Difference]: Start difference. First operand 2262 states and 5119 transitions. Second operand 11 states. [2018-10-01 00:34:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:32,990 INFO L93 Difference]: Finished difference Result 2951 states and 6564 transitions. [2018-10-01 00:34:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:34:32,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:34:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:32,993 INFO L225 Difference]: With dead ends: 2951 [2018-10-01 00:34:32,993 INFO L226 Difference]: Without dead ends: 2943 [2018-10-01 00:34:32,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:34:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2018-10-01 00:34:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2202. [2018-10-01 00:34:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-10-01 00:34:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 4975 transitions. [2018-10-01 00:34:36,109 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 4975 transitions. Word has length 20 [2018-10-01 00:34:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:36,110 INFO L480 AbstractCegarLoop]: Abstraction has 2202 states and 4975 transitions. [2018-10-01 00:34:36,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:34:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 4975 transitions. [2018-10-01 00:34:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:34:36,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:36,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:36,111 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:36,111 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1854713429, now seen corresponding path program 1 times [2018-10-01 00:34:36,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:36,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:36,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:36,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:36,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:36,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:36,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:36,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:34:36,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:34:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:34:36,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:36,334 INFO L87 Difference]: Start difference. First operand 2202 states and 4975 transitions. Second operand 11 states. [2018-10-01 00:34:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:48,469 INFO L93 Difference]: Finished difference Result 3183 states and 7090 transitions. [2018-10-01 00:34:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:34:48,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:34:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:48,473 INFO L225 Difference]: With dead ends: 3183 [2018-10-01 00:34:48,473 INFO L226 Difference]: Without dead ends: 3175 [2018-10-01 00:34:48,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:34:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-10-01 00:34:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2136. [2018-10-01 00:34:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-10-01 00:34:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4831 transitions. [2018-10-01 00:34:51,646 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4831 transitions. Word has length 20 [2018-10-01 00:34:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:51,647 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4831 transitions. [2018-10-01 00:34:51,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:34:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4831 transitions. [2018-10-01 00:34:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:34:51,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:51,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:34:51,648 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:51,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1962563576, now seen corresponding path program 1 times [2018-10-01 00:34:51,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:51,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:51,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:51,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:51,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:34:51,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:51,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-01 00:34:51,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:34:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:34:51,888 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:51,888 INFO L87 Difference]: Start difference. First operand 2136 states and 4831 transitions. Second operand 11 states. [2018-10-01 00:35:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:03,644 INFO L93 Difference]: Finished difference Result 3044 states and 6774 transitions. [2018-10-01 00:35:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:35:03,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:35:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:03,647 INFO L225 Difference]: With dead ends: 3044 [2018-10-01 00:35:03,647 INFO L226 Difference]: Without dead ends: 3036 [2018-10-01 00:35:03,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:35:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2018-10-01 00:35:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1834. [2018-10-01 00:35:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2018-10-01 00:35:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4141 transitions. [2018-10-01 00:35:06,318 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 4141 transitions. Word has length 20 [2018-10-01 00:35:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 1834 states and 4141 transitions. [2018-10-01 00:35:06,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:35:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 4141 transitions. [2018-10-01 00:35:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:35:06,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:06,320 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:35:06,320 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:06,320 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash 371911669, now seen corresponding path program 1 times [2018-10-01 00:35:06,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:06,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:06,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:06,438 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:06,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:06,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:35:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:06,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:06,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:06,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 00:35:06,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:35:06,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:35:06,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:06,641 INFO L87 Difference]: Start difference. First operand 1834 states and 4141 transitions. Second operand 20 states. [2018-10-01 00:36:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:01,521 INFO L93 Difference]: Finished difference Result 5978 states and 13245 transitions. [2018-10-01 00:36:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-01 00:36:01,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-01 00:36:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:01,526 INFO L225 Difference]: With dead ends: 5978 [2018-10-01 00:36:01,527 INFO L226 Difference]: Without dead ends: 5970 [2018-10-01 00:36:01,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s Time [2018-10-01 00:36:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2018-10-01 00:36:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 3311. [2018-10-01 00:36:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-10-01 00:36:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 7569 transitions. [2018-10-01 00:36:06,407 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 7569 transitions. Word has length 21 [2018-10-01 00:36:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 7569 transitions. [2018-10-01 00:36:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:36:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 7569 transitions. [2018-10-01 00:36:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:36:06,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:06,409 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:06,409 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:06,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -461254251, now seen corresponding path program 2 times [2018-10-01 00:36:06,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:06,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:06,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:06,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:36:06,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:36:06,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:06,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:06,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:06,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-01 00:36:06,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:36:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:36:06,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:06,756 INFO L87 Difference]: Start difference. First operand 3311 states and 7569 transitions. Second operand 21 states. [2018-10-01 00:36:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:50,410 INFO L93 Difference]: Finished difference Result 6725 states and 15108 transitions. [2018-10-01 00:36:50,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:36:50,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-01 00:36:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:50,416 INFO L225 Difference]: With dead ends: 6725 [2018-10-01 00:36:50,416 INFO L226 Difference]: Without dead ends: 6717 [2018-10-01 00:36:50,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time [2018-10-01 00:36:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2018-10-01 00:36:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 2426. [2018-10-01 00:36:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2018-10-01 00:36:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 5536 transitions. [2018-10-01 00:36:54,452 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 5536 transitions. Word has length 21 [2018-10-01 00:36:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:54,452 INFO L480 AbstractCegarLoop]: Abstraction has 2426 states and 5536 transitions. [2018-10-01 00:36:54,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:36:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 5536 transitions. [2018-10-01 00:36:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:36:54,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:54,454 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:36:54,454 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:54,454 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 504785992, now seen corresponding path program 1 times [2018-10-01 00:36:54,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:54,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:54,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:54,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:54,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:36:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:54,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:54,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:54,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-01 00:36:54,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:36:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:36:54,703 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:54,703 INFO L87 Difference]: Start difference. First operand 2426 states and 5536 transitions. Second operand 13 states. [2018-10-01 00:37:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:16,174 INFO L93 Difference]: Finished difference Result 8061 states and 18335 transitions. [2018-10-01 00:37:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:37:16,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-01 00:37:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:16,179 INFO L225 Difference]: With dead ends: 8061 [2018-10-01 00:37:16,180 INFO L226 Difference]: Without dead ends: 5636 [2018-10-01 00:37:16,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:37:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2018-10-01 00:37:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 3316. [2018-10-01 00:37:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-10-01 00:37:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7500 transitions. [2018-10-01 00:37:21,769 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7500 transitions. Word has length 24 [2018-10-01 00:37:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:21,770 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 7500 transitions. [2018-10-01 00:37:21,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:37:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7500 transitions. [2018-10-01 00:37:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:37:21,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:21,771 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:37:21,771 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:21,771 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1269424552, now seen corresponding path program 1 times [2018-10-01 00:37:21,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:21,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:21,930 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:21,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:21,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:22,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:22,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-01 00:37:22,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:37:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:37:22,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:22,119 INFO L87 Difference]: Start difference. First operand 3316 states and 7500 transitions. Second operand 14 states. [2018-10-01 00:37:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:41,973 INFO L93 Difference]: Finished difference Result 9123 states and 20565 transitions. [2018-10-01 00:37:41,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:37:41,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-01 00:37:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:41,979 INFO L225 Difference]: With dead ends: 9123 [2018-10-01 00:37:41,979 INFO L226 Difference]: Without dead ends: 5808 [2018-10-01 00:37:41,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:37:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2018-10-01 00:37:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 3396. [2018-10-01 00:37:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-10-01 00:37:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 7743 transitions. [2018-10-01 00:37:47,632 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 7743 transitions. Word has length 24 [2018-10-01 00:37:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:47,633 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 7743 transitions. [2018-10-01 00:37:47,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:37:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 7743 transitions. [2018-10-01 00:37:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:37:47,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:47,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:37:47,634 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:47,635 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:47,635 INFO L82 PathProgramCache]: Analyzing trace with hash -277435291, now seen corresponding path program 1 times [2018-10-01 00:37:47,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:47,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:47,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:47,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:47,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:47,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:47,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:47,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:47,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-10-01 00:37:47,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:37:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:37:47,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:47,933 INFO L87 Difference]: Start difference. First operand 3396 states and 7743 transitions. Second operand 15 states. Received shutdown request... [2018-10-01 00:38:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:38:14,849 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:38:14,855 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:38:14,856 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:38:14 BoogieIcfgContainer [2018-10-01 00:38:14,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:38:14,857 INFO L168 Benchmark]: Toolchain (without parser) took 808376.61 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 486.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 278.6 MB). Peak memory consumption was 765.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:14,859 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:14,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:14,860 INFO L168 Benchmark]: Boogie Preprocessor took 61.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:38:14,860 INFO L168 Benchmark]: RCFGBuilder took 983.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:14,861 INFO L168 Benchmark]: TraceAbstraction took 807276.87 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 486.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 246.9 MB). Peak memory consumption was 733.4 MB. Max. memory is 7.1 GB. [2018-10-01 00:38:14,865 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 983.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 807276.87 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 486.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 246.9 MB). Peak memory consumption was 733.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (3396states) and FLOYD_HOARE automaton (currently 39 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (6802 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 807.1s OverallTime, 62 OverallIterations, 2 TraceHistogramMax, 714.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16052 SDtfs, 59811 SDslu, 60586 SDs, 0 SdLazy, 129640 SolverSat, 13383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 143.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2395 GetRequests, 399 SyntacticMatches, 12 SemanticMatches, 1984 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3396occurred in iteration=61, 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: 78.9s AutomataMinimizationTime, 61 MinimizatonAttempts, 44875 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 1412 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 1325 ConstructedInterpolants, 0 QuantifiedInterpolants, 89833 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 87 InterpolantComputations, 37 PerfectInterpolantSequences, 87/197 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_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-38-14-879.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-38-14-879.csv Completed graceful shutdown