java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:34:30,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:34:30,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:34:30,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:34:30,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:34:30,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:34:30,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:34:30,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:34:30,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:34:30,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:34:30,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:34:30,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:34:30,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:34:30,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:34:30,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:34:30,486 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:34:30,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:34:30,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:34:30,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:34:30,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:34:30,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:34:30,504 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:34:30,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:34:30,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:34:30,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:34:30,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:34:30,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:34:30,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:34:30,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:34:30,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:34:30,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:34:30,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:34:30,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:34:30,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:34:30,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:34:30,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:34:30,526 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-09-30 20:34:30,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:34:30,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:34:30,556 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:34:30,556 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:34:30,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:34:30,560 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:34:30,561 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:34:30,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:34:30,561 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:34:30,561 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:34:30,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:34:30,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:34:30,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:34:30,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:34:30,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:34:30,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:34:30,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:34:30,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:34:30,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:34:30,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:34:30,564 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:34:30,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:34:30,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:30,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:34:30,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:34:30,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:34:30,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:34:30,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:34:30,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:34:30,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:34:30,568 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:34:30,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:34:30,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:34:30,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:34:30,642 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:34:30,642 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:34:30,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-30 20:34:30,644 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-30 20:34:30,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:34:30,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:34:30,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:30,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:34:30,709 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:34:30,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,750 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:34:30,750 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:34:30,750 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:34:30,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:34:30,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:34:30,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:34:30,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:34:30,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... [2018-09-30 20:34:30,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:34:30,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:34:30,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:34:30,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:34:30,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:34:30,859 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:34:30,860 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:34:30,860 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:34:31,263 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:34:31,265 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:31 BoogieIcfgContainer [2018-09-30 20:34:31,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:34:31,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:34:31,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:34:31,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:34:31,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:34:30" (1/2) ... [2018-09-30 20:34:31,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e0089c and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:34:31, skipping insertion in model container [2018-09-30 20:34:31,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:34:31" (2/2) ... [2018-09-30 20:34:31,275 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-30 20:34:31,288 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:34:31,299 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 20:34:31,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:34:31,364 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:34:31,364 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:34:31,364 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:34:31,364 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:34:31,364 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:34:31,365 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:34:31,365 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:34:31,365 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:34:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-30 20:34:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:34:31,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:31,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:34:31,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:31,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:31,418 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-30 20:34:31,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:31,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:31,664 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:31,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:31,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:31,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:31,685 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-30 20:34:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:33,223 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-30 20:34:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:33,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 20:34:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:33,240 INFO L225 Difference]: With dead ends: 32 [2018-09-30 20:34:33,241 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:34:33,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:34:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-30 20:34:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 20:34:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-30 20:34:33,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-30 20:34:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:33,287 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-30 20:34:33,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-30 20:34:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:34:33,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:33,288 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:34:33,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:33,290 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-30 20:34:33,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:33,359 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:33,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:34:33,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:34:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:34:33,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:33,363 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-30 20:34:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:33,970 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-30 20:34:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:34:33,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 20:34:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:33,973 INFO L225 Difference]: With dead ends: 38 [2018-09-30 20:34:33,973 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 20:34:33,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 20:34:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-30 20:34:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:34:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-30 20:34:33,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-30 20:34:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:33,990 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-30 20:34:33,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:34:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-30 20:34:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:33,991 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:33,991 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:33,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:33,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-30 20:34:33,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:34,088 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:34,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:34,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:34,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:34,090 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-30 20:34:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:35,167 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-30 20:34:35,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:35,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 20:34:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:35,170 INFO L225 Difference]: With dead ends: 43 [2018-09-30 20:34:35,170 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 20:34:35,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 20:34:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-30 20:34:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 20:34:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-30 20:34:35,181 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-30 20:34:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:35,181 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-30 20:34:35,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-30 20:34:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:34:35,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:35,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 20:34:35,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:35,183 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-30 20:34:35,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:35,265 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:35,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:34:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:34:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:34:35,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:35,267 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-30 20:34:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:35,922 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-30 20:34:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:34:35,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 20:34:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:35,926 INFO L225 Difference]: With dead ends: 54 [2018-09-30 20:34:35,927 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 20:34:35,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:34:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 20:34:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-30 20:34:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 20:34:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-30 20:34:35,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-30 20:34:35,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:35,940 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-30 20:34:35,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:34:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-30 20:34:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:35,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:35,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:35,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:35,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-30 20:34:35,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:35,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:35,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:36,050 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:36,050 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-09-30 20:34:36,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:36,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:36,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:36,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 20:34:36,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:34:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:34:36,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:36,263 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-09-30 20:34:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:38,929 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-09-30 20:34:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:34:38,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-09-30 20:34:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:38,932 INFO L225 Difference]: With dead ends: 107 [2018-09-30 20:34:38,933 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 20:34:38,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:34:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 20:34:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-09-30 20:34:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 20:34:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-09-30 20:34:38,947 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-09-30 20:34:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:38,947 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-09-30 20:34:38,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:34:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-09-30 20:34:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:38,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:38,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:38,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:38,949 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-30 20:34:38,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:39,038 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:39,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:34:39,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:34:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:34:39,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:39,040 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-09-30 20:34:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:40,211 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-09-30 20:34:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:34:40,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:34:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:40,214 INFO L225 Difference]: With dead ends: 95 [2018-09-30 20:34:40,214 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 20:34:40,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 20:34:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-30 20:34:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 20:34:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-09-30 20:34:40,232 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-09-30 20:34:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:40,232 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-09-30 20:34:40,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:34:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-09-30 20:34:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:40,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:40,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:40,234 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:40,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-30 20:34:40,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:40,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:40,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:40,450 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-09-30 20:34:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:40,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:40,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:40,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 20:34:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:40,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:40,838 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-09-30 20:34:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:45,360 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-09-30 20:34:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:34:45,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 20:34:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:45,365 INFO L225 Difference]: With dead ends: 150 [2018-09-30 20:34:45,365 INFO L226 Difference]: Without dead ends: 148 [2018-09-30 20:34:45,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-09-30 20:34:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-30 20:34:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-09-30 20:34:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-30 20:34:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-09-30 20:34:45,386 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-09-30 20:34:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:45,386 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-09-30 20:34:45,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-09-30 20:34:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:45,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:45,387 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:45,388 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:45,388 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-30 20:34:45,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:45,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:45,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:45,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:45,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:45,450 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-09-30 20:34:45,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:45,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:45,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:45,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-09-30 20:34:45,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:45,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:45,639 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-09-30 20:34:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:48,090 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-30 20:34:48,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:48,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 20:34:48,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:48,092 INFO L225 Difference]: With dead ends: 137 [2018-09-30 20:34:48,092 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 20:34:48,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:34:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 20:34:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-30 20:34:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 20:34:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-30 20:34:48,114 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-30 20:34:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:48,115 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-30 20:34:48,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-30 20:34:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:48,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:48,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:48,116 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:48,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-30 20:34:48,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:48,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:48,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:48,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:48,206 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-09-30 20:34:48,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:48,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:48,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:48,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-09-30 20:34:48,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:48,310 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:48,310 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-09-30 20:34:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:50,707 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-30 20:34:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:34:50,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 20:34:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:50,712 INFO L225 Difference]: With dead ends: 137 [2018-09-30 20:34:50,712 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 20:34:50,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 20:34:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-30 20:34:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 20:34:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-30 20:34:50,747 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-30 20:34:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:50,747 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-30 20:34:50,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:34:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-30 20:34:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:50,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:50,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:50,749 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:50,749 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-30 20:34:50,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:50,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:50,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:50,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:50,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 20:34:50,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:50,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:50,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:50,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 20:34:50,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:34:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:34:50,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:50,934 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 11 states. [2018-09-30 20:34:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:52,740 INFO L93 Difference]: Finished difference Result 168 states and 277 transitions. [2018-09-30 20:34:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:34:52,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-09-30 20:34:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:52,743 INFO L225 Difference]: With dead ends: 168 [2018-09-30 20:34:52,743 INFO L226 Difference]: Without dead ends: 167 [2018-09-30 20:34:52,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:34:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-30 20:34:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2018-09-30 20:34:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 20:34:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 228 transitions. [2018-09-30 20:34:52,772 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 228 transitions. Word has length 8 [2018-09-30 20:34:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:52,773 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 228 transitions. [2018-09-30 20:34:52,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:34:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 228 transitions. [2018-09-30 20:34:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:52,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:52,774 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:52,775 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:52,775 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:52,775 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-30 20:34:52,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:52,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:52,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:52,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:52,853 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:52,853 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-09-30 20:34:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:52,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:52,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:52,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 20:34:52,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:52,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:52,936 INFO L87 Difference]: Start difference. First operand 129 states and 228 transitions. Second operand 7 states. [2018-09-30 20:34:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:53,774 INFO L93 Difference]: Finished difference Result 174 states and 298 transitions. [2018-09-30 20:34:53,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:53,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:53,775 INFO L225 Difference]: With dead ends: 174 [2018-09-30 20:34:53,776 INFO L226 Difference]: Without dead ends: 172 [2018-09-30 20:34:53,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-30 20:34:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 138. [2018-09-30 20:34:53,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-30 20:34:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 245 transitions. [2018-09-30 20:34:53,798 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 245 transitions. Word has length 8 [2018-09-30 20:34:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:53,798 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 245 transitions. [2018-09-30 20:34:53,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 245 transitions. [2018-09-30 20:34:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:53,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:53,799 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:53,799 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:53,800 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-30 20:34:53,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:53,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:53,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:53,873 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-09-30 20:34:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:53,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:53,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:53,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 20:34:53,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:34:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:34:53,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:53,955 INFO L87 Difference]: Start difference. First operand 138 states and 245 transitions. Second operand 10 states. [2018-09-30 20:34:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:55,088 INFO L93 Difference]: Finished difference Result 186 states and 318 transitions. [2018-09-30 20:34:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:34:55,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-30 20:34:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:55,090 INFO L225 Difference]: With dead ends: 186 [2018-09-30 20:34:55,090 INFO L226 Difference]: Without dead ends: 185 [2018-09-30 20:34:55,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-30 20:34:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 156. [2018-09-30 20:34:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-30 20:34:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 277 transitions. [2018-09-30 20:34:55,113 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 277 transitions. Word has length 8 [2018-09-30 20:34:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:55,113 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 277 transitions. [2018-09-30 20:34:55,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:34:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 277 transitions. [2018-09-30 20:34:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:55,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:55,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:55,115 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:55,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:55,115 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-30 20:34:55,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:55,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:55,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:55,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:55,188 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:34:55,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:34:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:55,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:55,189 INFO L87 Difference]: Start difference. First operand 156 states and 277 transitions. Second operand 7 states. [2018-09-30 20:34:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:56,435 INFO L93 Difference]: Finished difference Result 221 states and 385 transitions. [2018-09-30 20:34:56,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:34:56,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:56,437 INFO L225 Difference]: With dead ends: 221 [2018-09-30 20:34:56,437 INFO L226 Difference]: Without dead ends: 219 [2018-09-30 20:34:56,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-30 20:34:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 168. [2018-09-30 20:34:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-30 20:34:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 298 transitions. [2018-09-30 20:34:56,463 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 298 transitions. Word has length 8 [2018-09-30 20:34:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:56,464 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 298 transitions. [2018-09-30 20:34:56,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 298 transitions. [2018-09-30 20:34:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:34:56,465 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:56,465 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:34:56,465 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:56,465 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-30 20:34:56,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:56,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:56,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:56,519 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:56,520 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-09-30 20:34:56,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:56,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:56,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:56,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 20:34:56,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:34:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:34:56,595 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:56,595 INFO L87 Difference]: Start difference. First operand 168 states and 298 transitions. Second operand 7 states. [2018-09-30 20:34:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:34:57,433 INFO L93 Difference]: Finished difference Result 296 states and 523 transitions. [2018-09-30 20:34:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:34:57,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 20:34:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:34:57,436 INFO L225 Difference]: With dead ends: 296 [2018-09-30 20:34:57,436 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 20:34:57,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:34:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 20:34:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 239. [2018-09-30 20:34:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-30 20:34:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 427 transitions. [2018-09-30 20:34:57,482 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 427 transitions. Word has length 8 [2018-09-30 20:34:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:34:57,482 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 427 transitions. [2018-09-30 20:34:57,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:34:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 427 transitions. [2018-09-30 20:34:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:34:57,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:34:57,483 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:34:57,483 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:34:57,483 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:34:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -799219888, now seen corresponding path program 1 times [2018-09-30 20:34:57,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:34:57,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:34:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:57,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:34:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:57,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:34:57,578 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-09-30 20:34:57,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:34:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:34:57,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:34:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:34:57,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:34:57,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-09-30 20:34:57,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:34:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:34:57,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:34:57,784 INFO L87 Difference]: Start difference. First operand 239 states and 427 transitions. Second operand 13 states. [2018-09-30 20:35:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:00,047 INFO L93 Difference]: Finished difference Result 315 states and 571 transitions. [2018-09-30 20:35:00,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:00,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-09-30 20:35:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:00,050 INFO L225 Difference]: With dead ends: 315 [2018-09-30 20:35:00,050 INFO L226 Difference]: Without dead ends: 313 [2018-09-30 20:35:00,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-30 20:35:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 261. [2018-09-30 20:35:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 20:35:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 467 transitions. [2018-09-30 20:35:00,110 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 467 transitions. Word has length 9 [2018-09-30 20:35:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 467 transitions. [2018-09-30 20:35:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 467 transitions. [2018-09-30 20:35:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:35:00,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:00,111 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:00,112 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:00,112 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1170716006, now seen corresponding path program 1 times [2018-09-30 20:35:00,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:00,209 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:00,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-09-30 20:35:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:00,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:00,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:00,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 20:35:00,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:00,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:00,338 INFO L87 Difference]: Start difference. First operand 261 states and 467 transitions. Second operand 14 states. [2018-09-30 20:35:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:04,956 INFO L93 Difference]: Finished difference Result 582 states and 1032 transitions. [2018-09-30 20:35:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:35:04,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2018-09-30 20:35:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:04,960 INFO L225 Difference]: With dead ends: 582 [2018-09-30 20:35:04,960 INFO L226 Difference]: Without dead ends: 580 [2018-09-30 20:35:04,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:35:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-09-30 20:35:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 463. [2018-09-30 20:35:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-09-30 20:35:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 838 transitions. [2018-09-30 20:35:05,101 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 838 transitions. Word has length 9 [2018-09-30 20:35:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:05,101 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 838 transitions. [2018-09-30 20:35:05,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 838 transitions. [2018-09-30 20:35:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:05,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:05,103 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:05,103 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:05,103 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-30 20:35:05,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:05,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:05,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:05,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:05,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:05,192 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-09-30 20:35:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:05,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:05,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:05,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 20:35:05,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:35:05,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:35:05,341 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:05,341 INFO L87 Difference]: Start difference. First operand 463 states and 838 transitions. Second operand 10 states. [2018-09-30 20:35:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:08,877 INFO L93 Difference]: Finished difference Result 594 states and 1059 transitions. [2018-09-30 20:35:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:35:08,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 20:35:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:08,885 INFO L225 Difference]: With dead ends: 594 [2018-09-30 20:35:08,885 INFO L226 Difference]: Without dead ends: 592 [2018-09-30 20:35:08,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-09-30 20:35:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 467. [2018-09-30 20:35:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-09-30 20:35:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 846 transitions. [2018-09-30 20:35:09,000 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 846 transitions. Word has length 11 [2018-09-30 20:35:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:09,001 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 846 transitions. [2018-09-30 20:35:09,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:35:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 846 transitions. [2018-09-30 20:35:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:09,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:09,002 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:09,002 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:09,002 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-30 20:35:09,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:09,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:09,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:09,251 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-09-30 20:35:09,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:09,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:09,362 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:35:09,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-09-30 20:35:09,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:09,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:09,362 INFO L87 Difference]: Start difference. First operand 467 states and 846 transitions. Second operand 14 states. [2018-09-30 20:35:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:14,422 INFO L93 Difference]: Finished difference Result 1089 states and 1952 transitions. [2018-09-30 20:35:14,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:35:14,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-09-30 20:35:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:14,426 INFO L225 Difference]: With dead ends: 1089 [2018-09-30 20:35:14,427 INFO L226 Difference]: Without dead ends: 661 [2018-09-30 20:35:14,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-09-30 20:35:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-09-30 20:35:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 537. [2018-09-30 20:35:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-09-30 20:35:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 963 transitions. [2018-09-30 20:35:14,590 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 963 transitions. Word has length 11 [2018-09-30 20:35:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 963 transitions. [2018-09-30 20:35:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 963 transitions. [2018-09-30 20:35:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:14,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:14,591 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:14,592 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:14,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-30 20:35:14,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:14,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:14,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:14,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 20:35:14,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:14,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:14,973 INFO L87 Difference]: Start difference. First operand 537 states and 963 transitions. Second operand 8 states. [2018-09-30 20:35:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:16,348 INFO L93 Difference]: Finished difference Result 613 states and 1088 transitions. [2018-09-30 20:35:16,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:35:16,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 20:35:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:16,360 INFO L225 Difference]: With dead ends: 613 [2018-09-30 20:35:16,360 INFO L226 Difference]: Without dead ends: 611 [2018-09-30 20:35:16,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:35:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-30 20:35:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 547. [2018-09-30 20:35:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-09-30 20:35:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 976 transitions. [2018-09-30 20:35:16,490 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 976 transitions. Word has length 11 [2018-09-30 20:35:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:16,490 INFO L480 AbstractCegarLoop]: Abstraction has 547 states and 976 transitions. [2018-09-30 20:35:16,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 976 transitions. [2018-09-30 20:35:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:16,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:16,491 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:16,492 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:16,492 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-09-30 20:35:16,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:16,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:16,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:16,648 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:16,648 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-09-30 20:35:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:16,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:16,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:16,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 20:35:16,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:16,951 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:16,951 INFO L87 Difference]: Start difference. First operand 547 states and 976 transitions. Second operand 13 states. [2018-09-30 20:35:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:19,641 INFO L93 Difference]: Finished difference Result 1152 states and 2033 transitions. [2018-09-30 20:35:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:35:19,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 20:35:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:19,644 INFO L225 Difference]: With dead ends: 1152 [2018-09-30 20:35:19,644 INFO L226 Difference]: Without dead ends: 636 [2018-09-30 20:35:19,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:35:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-09-30 20:35:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 561. [2018-09-30 20:35:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-09-30 20:35:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1000 transitions. [2018-09-30 20:35:19,781 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1000 transitions. Word has length 11 [2018-09-30 20:35:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:19,781 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 1000 transitions. [2018-09-30 20:35:19,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1000 transitions. [2018-09-30 20:35:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:19,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:19,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:19,782 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:19,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-30 20:35:19,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:19,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:19,868 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:35:19,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:35:19,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:35:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:35:19,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:19,869 INFO L87 Difference]: Start difference. First operand 561 states and 1000 transitions. Second operand 8 states. [2018-09-30 20:35:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:21,021 INFO L93 Difference]: Finished difference Result 590 states and 1032 transitions. [2018-09-30 20:35:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:35:21,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 20:35:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:21,030 INFO L225 Difference]: With dead ends: 590 [2018-09-30 20:35:21,030 INFO L226 Difference]: Without dead ends: 588 [2018-09-30 20:35:21,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-09-30 20:35:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 561. [2018-09-30 20:35:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-09-30 20:35:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1000 transitions. [2018-09-30 20:35:21,171 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1000 transitions. Word has length 11 [2018-09-30 20:35:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:21,171 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 1000 transitions. [2018-09-30 20:35:21,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:35:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1000 transitions. [2018-09-30 20:35:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:21,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:21,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:21,173 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:21,173 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-30 20:35:21,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:21,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:21,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:21,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:21,322 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-09-30 20:35:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:21,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:21,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:21,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-30 20:35:21,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:35:21,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:35:21,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:21,390 INFO L87 Difference]: Start difference. First operand 561 states and 1000 transitions. Second operand 9 states. [2018-09-30 20:35:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:22,552 INFO L93 Difference]: Finished difference Result 615 states and 1081 transitions. [2018-09-30 20:35:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:35:22,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-30 20:35:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:22,556 INFO L225 Difference]: With dead ends: 615 [2018-09-30 20:35:22,556 INFO L226 Difference]: Without dead ends: 613 [2018-09-30 20:35:22,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-09-30 20:35:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 560. [2018-09-30 20:35:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-09-30 20:35:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 998 transitions. [2018-09-30 20:35:22,682 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 998 transitions. Word has length 11 [2018-09-30 20:35:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:22,682 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 998 transitions. [2018-09-30 20:35:22,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:35:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 998 transitions. [2018-09-30 20:35:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:22,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:22,683 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:22,683 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:22,683 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:22,683 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-30 20:35:22,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:22,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:22,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:22,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:22,755 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:22,755 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-09-30 20:35:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:22,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:22,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:22,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-09-30 20:35:22,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:22,879 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:22,879 INFO L87 Difference]: Start difference. First operand 560 states and 998 transitions. Second operand 13 states. [2018-09-30 20:35:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:25,803 INFO L93 Difference]: Finished difference Result 783 states and 1364 transitions. [2018-09-30 20:35:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:35:25,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 20:35:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:25,806 INFO L225 Difference]: With dead ends: 783 [2018-09-30 20:35:25,806 INFO L226 Difference]: Without dead ends: 781 [2018-09-30 20:35:25,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-09-30 20:35:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 608. [2018-09-30 20:35:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-09-30 20:35:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1084 transitions. [2018-09-30 20:35:25,966 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1084 transitions. Word has length 11 [2018-09-30 20:35:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:25,966 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 1084 transitions. [2018-09-30 20:35:25,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1084 transitions. [2018-09-30 20:35:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:25,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:25,967 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:25,968 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:25,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-30 20:35:25,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:25,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:25,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:25,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:26,057 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:26,057 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-09-30 20:35:26,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:35:26,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:35:26,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:35:26,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:26,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:26,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:35:26,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:35:26,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:35:26,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:26,123 INFO L87 Difference]: Start difference. First operand 608 states and 1084 transitions. Second operand 7 states. [2018-09-30 20:35:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:27,375 INFO L93 Difference]: Finished difference Result 752 states and 1322 transitions. [2018-09-30 20:35:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:35:27,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 20:35:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:27,385 INFO L225 Difference]: With dead ends: 752 [2018-09-30 20:35:27,385 INFO L226 Difference]: Without dead ends: 750 [2018-09-30 20:35:27,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-09-30 20:35:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 605. [2018-09-30 20:35:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-09-30 20:35:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1079 transitions. [2018-09-30 20:35:27,544 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1079 transitions. Word has length 11 [2018-09-30 20:35:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:27,544 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 1079 transitions. [2018-09-30 20:35:27,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:35:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1079 transitions. [2018-09-30 20:35:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:27,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:27,545 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:27,545 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:27,545 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-30 20:35:27,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:27,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:27,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:35:27,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:27,633 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:27,633 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-09-30 20:35:27,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:27,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:27,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:27,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:35:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:35:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:35:27,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:27,690 INFO L87 Difference]: Start difference. First operand 605 states and 1079 transitions. Second operand 7 states. [2018-09-30 20:35:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:29,323 INFO L93 Difference]: Finished difference Result 770 states and 1359 transitions. [2018-09-30 20:35:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:35:29,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 20:35:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:29,327 INFO L225 Difference]: With dead ends: 770 [2018-09-30 20:35:29,328 INFO L226 Difference]: Without dead ends: 768 [2018-09-30 20:35:29,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-09-30 20:35:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 636. [2018-09-30 20:35:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-09-30 20:35:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1134 transitions. [2018-09-30 20:35:29,491 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1134 transitions. Word has length 11 [2018-09-30 20:35:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:29,492 INFO L480 AbstractCegarLoop]: Abstraction has 636 states and 1134 transitions. [2018-09-30 20:35:29,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:35:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1134 transitions. [2018-09-30 20:35:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:29,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:29,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:29,493 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:29,493 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-30 20:35:29,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:29,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:29,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:29,566 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-09-30 20:35:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:29,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:29,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:29,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:35:29,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:35:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:35:29,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:29,635 INFO L87 Difference]: Start difference. First operand 636 states and 1134 transitions. Second operand 7 states. [2018-09-30 20:35:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:30,666 INFO L93 Difference]: Finished difference Result 711 states and 1251 transitions. [2018-09-30 20:35:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:35:30,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 20:35:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:30,670 INFO L225 Difference]: With dead ends: 711 [2018-09-30 20:35:30,670 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 20:35:30,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 20:35:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 648. [2018-09-30 20:35:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-09-30 20:35:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1150 transitions. [2018-09-30 20:35:30,844 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1150 transitions. Word has length 11 [2018-09-30 20:35:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:30,844 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1150 transitions. [2018-09-30 20:35:30,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:35:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1150 transitions. [2018-09-30 20:35:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:30,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:30,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:30,845 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:30,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-30 20:35:30,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:31,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:31,185 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-09-30 20:35:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:31,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:31,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:31,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:35:31,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:35:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:35:31,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:31,258 INFO L87 Difference]: Start difference. First operand 648 states and 1150 transitions. Second operand 7 states. [2018-09-30 20:35:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:32,554 INFO L93 Difference]: Finished difference Result 745 states and 1308 transitions. [2018-09-30 20:35:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:35:32,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 20:35:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:32,557 INFO L225 Difference]: With dead ends: 745 [2018-09-30 20:35:32,557 INFO L226 Difference]: Without dead ends: 743 [2018-09-30 20:35:32,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-09-30 20:35:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 630. [2018-09-30 20:35:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-09-30 20:35:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1116 transitions. [2018-09-30 20:35:32,711 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1116 transitions. Word has length 11 [2018-09-30 20:35:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:32,712 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 1116 transitions. [2018-09-30 20:35:32,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:35:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1116 transitions. [2018-09-30 20:35:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:35:32,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:32,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:32,713 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:32,713 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-30 20:35:32,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:32,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:32,775 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:32,775 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-09-30 20:35:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:32,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:32,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:32,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:35:32,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:35:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:35:32,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:32,843 INFO L87 Difference]: Start difference. First operand 630 states and 1116 transitions. Second operand 7 states. [2018-09-30 20:35:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:34,210 INFO L93 Difference]: Finished difference Result 711 states and 1249 transitions. [2018-09-30 20:35:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:35:34,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 20:35:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:34,213 INFO L225 Difference]: With dead ends: 711 [2018-09-30 20:35:34,213 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 20:35:34,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:35:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 20:35:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 621. [2018-09-30 20:35:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-09-30 20:35:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1094 transitions. [2018-09-30 20:35:34,358 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1094 transitions. Word has length 11 [2018-09-30 20:35:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:34,358 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 1094 transitions. [2018-09-30 20:35:34,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:35:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1094 transitions. [2018-09-30 20:35:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:34,359 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:34,359 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:34,359 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:34,359 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1730496441, now seen corresponding path program 1 times [2018-09-30 20:35:34,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:34,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:34,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:34,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:34,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:34,533 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-09-30 20:35:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:34,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:34,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:34,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-09-30 20:35:34,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:35:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:35:34,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:34,649 INFO L87 Difference]: Start difference. First operand 621 states and 1094 transitions. Second operand 11 states. [2018-09-30 20:35:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:36,337 INFO L93 Difference]: Finished difference Result 1305 states and 2267 transitions. [2018-09-30 20:35:36,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:35:36,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-09-30 20:35:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:36,340 INFO L225 Difference]: With dead ends: 1305 [2018-09-30 20:35:36,340 INFO L226 Difference]: Without dead ends: 715 [2018-09-30 20:35:36,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-09-30 20:35:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 603. [2018-09-30 20:35:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-09-30 20:35:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1053 transitions. [2018-09-30 20:35:36,489 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1053 transitions. Word has length 12 [2018-09-30 20:35:36,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:36,489 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 1053 transitions. [2018-09-30 20:35:36,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:35:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1053 transitions. [2018-09-30 20:35:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:36,490 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:36,490 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:36,490 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:36,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-30 20:35:36,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:36,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:36,599 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-09-30 20:35:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:36,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:36,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:36,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-09-30 20:35:36,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:36,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:36,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:36,726 INFO L87 Difference]: Start difference. First operand 603 states and 1053 transitions. Second operand 14 states. [2018-09-30 20:35:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:39,355 INFO L93 Difference]: Finished difference Result 835 states and 1450 transitions. [2018-09-30 20:35:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:35:39,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-09-30 20:35:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:39,358 INFO L225 Difference]: With dead ends: 835 [2018-09-30 20:35:39,358 INFO L226 Difference]: Without dead ends: 833 [2018-09-30 20:35:39,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:35:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2018-09-30 20:35:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 646. [2018-09-30 20:35:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-09-30 20:35:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1132 transitions. [2018-09-30 20:35:39,518 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1132 transitions. Word has length 12 [2018-09-30 20:35:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:39,518 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 1132 transitions. [2018-09-30 20:35:39,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1132 transitions. [2018-09-30 20:35:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:35:39,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:39,519 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:39,520 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:39,520 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:39,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-30 20:35:39,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:39,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,732 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:39,732 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-09-30 20:35:39,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:39,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:39,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:39,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-30 20:35:39,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:35:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:35:39,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:39,838 INFO L87 Difference]: Start difference. First operand 646 states and 1132 transitions. Second operand 13 states. [2018-09-30 20:35:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:43,440 INFO L93 Difference]: Finished difference Result 1390 states and 2446 transitions. [2018-09-30 20:35:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:35:43,440 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-30 20:35:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:43,445 INFO L225 Difference]: With dead ends: 1390 [2018-09-30 20:35:43,445 INFO L226 Difference]: Without dead ends: 1388 [2018-09-30 20:35:43,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2018-09-30 20:35:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1013. [2018-09-30 20:35:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-30 20:35:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1780 transitions. [2018-09-30 20:35:43,719 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1780 transitions. Word has length 12 [2018-09-30 20:35:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:43,719 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1780 transitions. [2018-09-30 20:35:43,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:35:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1780 transitions. [2018-09-30 20:35:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:43,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:43,720 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:43,721 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:43,721 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-30 20:35:43,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:43,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:43,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:43,836 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:43,836 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-09-30 20:35:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:43,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:43,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:43,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 20:35:43,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:35:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:35:43,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:43,949 INFO L87 Difference]: Start difference. First operand 1013 states and 1780 transitions. Second operand 11 states. [2018-09-30 20:35:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:46,492 INFO L93 Difference]: Finished difference Result 1151 states and 1992 transitions. [2018-09-30 20:35:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:35:46,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 20:35:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:46,497 INFO L225 Difference]: With dead ends: 1151 [2018-09-30 20:35:46,498 INFO L226 Difference]: Without dead ends: 1149 [2018-09-30 20:35:46,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:35:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2018-09-30 20:35:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1017. [2018-09-30 20:35:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2018-09-30 20:35:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1785 transitions. [2018-09-30 20:35:46,779 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1785 transitions. Word has length 14 [2018-09-30 20:35:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:46,779 INFO L480 AbstractCegarLoop]: Abstraction has 1017 states and 1785 transitions. [2018-09-30 20:35:46,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:35:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1785 transitions. [2018-09-30 20:35:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:46,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:46,780 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:46,781 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:46,781 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-09-30 20:35:46,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:46,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:46,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:46,939 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-09-30 20:35:46,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:46,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:47,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:47,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-30 20:35:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:35:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:35:47,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:47,107 INFO L87 Difference]: Start difference. First operand 1017 states and 1785 transitions. Second operand 14 states. [2018-09-30 20:35:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:51,239 INFO L93 Difference]: Finished difference Result 1165 states and 2018 transitions. [2018-09-30 20:35:51,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:35:51,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:35:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:51,245 INFO L225 Difference]: With dead ends: 1165 [2018-09-30 20:35:51,245 INFO L226 Difference]: Without dead ends: 1163 [2018-09-30 20:35:51,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:35:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2018-09-30 20:35:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1015. [2018-09-30 20:35:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2018-09-30 20:35:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1782 transitions. [2018-09-30 20:35:51,520 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1782 transitions. Word has length 14 [2018-09-30 20:35:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:51,520 INFO L480 AbstractCegarLoop]: Abstraction has 1015 states and 1782 transitions. [2018-09-30 20:35:51,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:35:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1782 transitions. [2018-09-30 20:35:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:51,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:51,521 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:51,521 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:51,521 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-30 20:35:51,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:51,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:51,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:51,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:51,605 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:51,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:51,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:51,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:51,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-09-30 20:35:51,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:35:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:35:51,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:51,683 INFO L87 Difference]: Start difference. First operand 1015 states and 1782 transitions. Second operand 12 states. [2018-09-30 20:35:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:53,860 INFO L93 Difference]: Finished difference Result 1144 states and 1986 transitions. [2018-09-30 20:35:53,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:35:53,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-30 20:35:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:53,864 INFO L225 Difference]: With dead ends: 1144 [2018-09-30 20:35:53,864 INFO L226 Difference]: Without dead ends: 1142 [2018-09-30 20:35:53,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-09-30 20:35:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1003. [2018-09-30 20:35:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2018-09-30 20:35:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1759 transitions. [2018-09-30 20:35:54,138 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1759 transitions. Word has length 14 [2018-09-30 20:35:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:54,138 INFO L480 AbstractCegarLoop]: Abstraction has 1003 states and 1759 transitions. [2018-09-30 20:35:54,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:35:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1759 transitions. [2018-09-30 20:35:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:35:54,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:54,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:35:54,139 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:54,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:54,140 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-30 20:35:54,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:54,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:54,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:54,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:54,212 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:54,212 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:54,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:54,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:54,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:54,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 20:35:54,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:35:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:35:54,328 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:54,328 INFO L87 Difference]: Start difference. First operand 1003 states and 1759 transitions. Second operand 11 states. [2018-09-30 20:35:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:35:56,192 INFO L93 Difference]: Finished difference Result 1065 states and 1842 transitions. [2018-09-30 20:35:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:35:56,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 20:35:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:35:56,196 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 20:35:56,196 INFO L226 Difference]: Without dead ends: 1063 [2018-09-30 20:35:56,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:35:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-09-30 20:35:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 991. [2018-09-30 20:35:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2018-09-30 20:35:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1740 transitions. [2018-09-30 20:35:56,465 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1740 transitions. Word has length 14 [2018-09-30 20:35:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:35:56,466 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1740 transitions. [2018-09-30 20:35:56,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:35:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1740 transitions. [2018-09-30 20:35:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:35:56,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:35:56,467 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:35:56,467 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:35:56,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:35:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 2 times [2018-09-30 20:35:56,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:35:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:35:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:35:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:35:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:35:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:56,658 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:35:56,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:35:56,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:35:56,675 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:35:56,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:35:56,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:35:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:35:56,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:35:56,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 20:35:56,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:35:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:35:56,834 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:35:56,834 INFO L87 Difference]: Start difference. First operand 991 states and 1740 transitions. Second operand 18 states. [2018-09-30 20:36:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:01,391 INFO L93 Difference]: Finished difference Result 1165 states and 2035 transitions. [2018-09-30 20:36:01,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:36:01,392 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2018-09-30 20:36:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:01,396 INFO L225 Difference]: With dead ends: 1165 [2018-09-30 20:36:01,396 INFO L226 Difference]: Without dead ends: 1163 [2018-09-30 20:36:01,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:36:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2018-09-30 20:36:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1059. [2018-09-30 20:36:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-09-30 20:36:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1855 transitions. [2018-09-30 20:36:01,698 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1855 transitions. Word has length 15 [2018-09-30 20:36:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:01,698 INFO L480 AbstractCegarLoop]: Abstraction has 1059 states and 1855 transitions. [2018-09-30 20:36:01,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:36:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1855 transitions. [2018-09-30 20:36:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:01,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:01,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:01,700 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:01,700 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1863286224, now seen corresponding path program 1 times [2018-09-30 20:36:01,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:01,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:36:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:02,504 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:02,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:02,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:02,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:02,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 20:36:02,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:02,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:02,639 INFO L87 Difference]: Start difference. First operand 1059 states and 1855 transitions. Second operand 15 states. [2018-09-30 20:36:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:08,337 INFO L93 Difference]: Finished difference Result 2324 states and 4040 transitions. [2018-09-30 20:36:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:36:08,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:36:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:08,344 INFO L225 Difference]: With dead ends: 2324 [2018-09-30 20:36:08,344 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 20:36:08,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-09-30 20:36:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 20:36:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1199. [2018-09-30 20:36:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-09-30 20:36:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2060 transitions. [2018-09-30 20:36:08,683 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2060 transitions. Word has length 15 [2018-09-30 20:36:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:08,683 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 2060 transitions. [2018-09-30 20:36:08,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2060 transitions. [2018-09-30 20:36:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:08,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:08,685 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:08,685 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:08,685 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1810259450, now seen corresponding path program 1 times [2018-09-30 20:36:08,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:08,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:08,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:08,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:08,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:08,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:08,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:08,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:36:08,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:08,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:08,929 INFO L87 Difference]: Start difference. First operand 1199 states and 2060 transitions. Second operand 15 states. [2018-09-30 20:36:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:16,112 INFO L93 Difference]: Finished difference Result 3554 states and 6005 transitions. [2018-09-30 20:36:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-30 20:36:16,112 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:36:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:16,122 INFO L225 Difference]: With dead ends: 3554 [2018-09-30 20:36:16,122 INFO L226 Difference]: Without dead ends: 2262 [2018-09-30 20:36:16,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-09-30 20:36:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2018-09-30 20:36:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1715. [2018-09-30 20:36:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-09-30 20:36:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2949 transitions. [2018-09-30 20:36:16,625 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2949 transitions. Word has length 15 [2018-09-30 20:36:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:16,625 INFO L480 AbstractCegarLoop]: Abstraction has 1715 states and 2949 transitions. [2018-09-30 20:36:16,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2949 transitions. [2018-09-30 20:36:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:16,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:16,626 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:36:16,626 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:16,627 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1088358421, now seen corresponding path program 2 times [2018-09-30 20:36:16,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:16,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:16,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:16,778 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:16,778 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:36:16,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:36:16,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:36:16,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:17,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:17,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2018-09-30 20:36:17,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:36:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:36:17,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:17,057 INFO L87 Difference]: Start difference. First operand 1715 states and 2949 transitions. Second operand 17 states. [2018-09-30 20:36:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:22,825 INFO L93 Difference]: Finished difference Result 1939 states and 3325 transitions. [2018-09-30 20:36:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 20:36:22,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 20:36:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:22,830 INFO L225 Difference]: With dead ends: 1939 [2018-09-30 20:36:22,830 INFO L226 Difference]: Without dead ends: 1937 [2018-09-30 20:36:22,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:36:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-09-30 20:36:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1726. [2018-09-30 20:36:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-09-30 20:36:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2952 transitions. [2018-09-30 20:36:23,378 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2952 transitions. Word has length 15 [2018-09-30 20:36:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:23,378 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2952 transitions. [2018-09-30 20:36:23,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:36:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2952 transitions. [2018-09-30 20:36:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:23,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:23,379 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:36:23,379 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:23,379 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1622542677, now seen corresponding path program 1 times [2018-09-30 20:36:23,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:23,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:23,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:23,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:36:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:36:23,770 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:36:23,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:36:23,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:36:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:36:23,770 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:23,770 INFO L87 Difference]: Start difference. First operand 1726 states and 2952 transitions. Second operand 8 states. [2018-09-30 20:36:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:25,432 INFO L93 Difference]: Finished difference Result 1771 states and 3005 transitions. [2018-09-30 20:36:25,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:36:25,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-09-30 20:36:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:25,437 INFO L225 Difference]: With dead ends: 1771 [2018-09-30 20:36:25,437 INFO L226 Difference]: Without dead ends: 1769 [2018-09-30 20:36:25,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:36:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2018-09-30 20:36:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1724. [2018-09-30 20:36:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2018-09-30 20:36:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2942 transitions. [2018-09-30 20:36:25,962 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2942 transitions. Word has length 15 [2018-09-30 20:36:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:25,962 INFO L480 AbstractCegarLoop]: Abstraction has 1724 states and 2942 transitions. [2018-09-30 20:36:25,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:36:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2942 transitions. [2018-09-30 20:36:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:25,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:25,963 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:25,963 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:25,963 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1161913671, now seen corresponding path program 1 times [2018-09-30 20:36:25,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:25,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:25,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:25,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:26,070 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:26,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:26,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:26,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:26,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 20:36:26,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:26,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:26,174 INFO L87 Difference]: Start difference. First operand 1724 states and 2942 transitions. Second operand 15 states. [2018-09-30 20:36:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:32,263 INFO L93 Difference]: Finished difference Result 4338 states and 7260 transitions. [2018-09-30 20:36:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:36:32,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:36:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:32,268 INFO L225 Difference]: With dead ends: 4338 [2018-09-30 20:36:32,268 INFO L226 Difference]: Without dead ends: 2612 [2018-09-30 20:36:32,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:36:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2018-09-30 20:36:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 1846. [2018-09-30 20:36:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1846 states. [2018-09-30 20:36:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 3077 transitions. [2018-09-30 20:36:32,957 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 3077 transitions. Word has length 15 [2018-09-30 20:36:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:32,958 INFO L480 AbstractCegarLoop]: Abstraction has 1846 states and 3077 transitions. [2018-09-30 20:36:32,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 3077 transitions. [2018-09-30 20:36:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:32,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:32,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:32,959 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:32,959 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:32,959 INFO L82 PathProgramCache]: Analyzing trace with hash 712923771, now seen corresponding path program 1 times [2018-09-30 20:36:32,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:32,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:32,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:33,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:33,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:33,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:33,242 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:33,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-09-30 20:36:33,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:33,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:33,243 INFO L87 Difference]: Start difference. First operand 1846 states and 3077 transitions. Second operand 15 states. [2018-09-30 20:36:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:37,708 INFO L93 Difference]: Finished difference Result 2444 states and 4042 transitions. [2018-09-30 20:36:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:36:37,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:36:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:37,713 INFO L225 Difference]: With dead ends: 2444 [2018-09-30 20:36:37,714 INFO L226 Difference]: Without dead ends: 2442 [2018-09-30 20:36:37,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:36:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2018-09-30 20:36:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1867. [2018-09-30 20:36:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2018-09-30 20:36:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 3111 transitions. [2018-09-30 20:36:38,435 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 3111 transitions. Word has length 15 [2018-09-30 20:36:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:38,435 INFO L480 AbstractCegarLoop]: Abstraction has 1867 states and 3111 transitions. [2018-09-30 20:36:38,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 3111 transitions. [2018-09-30 20:36:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:38,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:38,436 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:38,437 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:38,437 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash -312855879, now seen corresponding path program 1 times [2018-09-30 20:36:38,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:38,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:38,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:38,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:36:38,492 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:38,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:38,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:38,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:36:38,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:38,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-09-30 20:36:38,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:36:38,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:36:38,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:38,597 INFO L87 Difference]: Start difference. First operand 1867 states and 3111 transitions. Second operand 11 states. [2018-09-30 20:36:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:40,794 INFO L93 Difference]: Finished difference Result 3270 states and 5447 transitions. [2018-09-30 20:36:40,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:36:40,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-09-30 20:36:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:40,798 INFO L225 Difference]: With dead ends: 3270 [2018-09-30 20:36:40,798 INFO L226 Difference]: Without dead ends: 2325 [2018-09-30 20:36:40,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:36:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-09-30 20:36:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1945. [2018-09-30 20:36:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-09-30 20:36:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3245 transitions. [2018-09-30 20:36:41,597 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3245 transitions. Word has length 15 [2018-09-30 20:36:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:41,597 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 3245 transitions. [2018-09-30 20:36:41,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:36:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3245 transitions. [2018-09-30 20:36:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:41,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:41,598 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:36:41,598 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:41,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-30 20:36:41,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:41,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:41,702 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:41,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:41,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:41,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:36:41,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:41,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:36:41,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:36:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:36:41,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:41,856 INFO L87 Difference]: Start difference. First operand 1945 states and 3245 transitions. Second operand 15 states. [2018-09-30 20:36:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:50,033 INFO L93 Difference]: Finished difference Result 3334 states and 5555 transitions. [2018-09-30 20:36:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-30 20:36:50,034 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:36:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:50,038 INFO L225 Difference]: With dead ends: 3334 [2018-09-30 20:36:50,038 INFO L226 Difference]: Without dead ends: 3074 [2018-09-30 20:36:50,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-09-30 20:36:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2018-09-30 20:36:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 2258. [2018-09-30 20:36:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2018-09-30 20:36:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3786 transitions. [2018-09-30 20:36:51,138 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3786 transitions. Word has length 15 [2018-09-30 20:36:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:36:51,138 INFO L480 AbstractCegarLoop]: Abstraction has 2258 states and 3786 transitions. [2018-09-30 20:36:51,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:36:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3786 transitions. [2018-09-30 20:36:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:36:51,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:36:51,139 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:36:51,139 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:36:51,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:36:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-30 20:36:51,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:36:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:36:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:51,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:36:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:36:51,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:36:51,495 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:36:51,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:36:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:36:51,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:36:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:36:51,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:36:51,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:36:51,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:36:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:36:51,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:36:51,642 INFO L87 Difference]: Start difference. First operand 2258 states and 3786 transitions. Second operand 16 states. [2018-09-30 20:36:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:36:59,324 INFO L93 Difference]: Finished difference Result 4220 states and 7044 transitions. [2018-09-30 20:36:59,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 20:36:59,324 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 20:36:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:36:59,327 INFO L225 Difference]: With dead ends: 4220 [2018-09-30 20:36:59,327 INFO L226 Difference]: Without dead ends: 2713 [2018-09-30 20:36:59,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-09-30 20:36:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2018-09-30 20:37:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2243. [2018-09-30 20:37:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-09-30 20:37:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3741 transitions. [2018-09-30 20:37:00,356 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3741 transitions. Word has length 15 [2018-09-30 20:37:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:00,357 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 3741 transitions. [2018-09-30 20:37:00,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3741 transitions. [2018-09-30 20:37:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:37:00,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:00,358 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:00,358 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:00,358 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1643695811, now seen corresponding path program 1 times [2018-09-30 20:37:00,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:00,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:00,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:00,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:00,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:00,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 20:37:00,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:37:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:37:00,681 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:00,681 INFO L87 Difference]: Start difference. First operand 2243 states and 3741 transitions. Second operand 16 states. [2018-09-30 20:37:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:07,225 INFO L93 Difference]: Finished difference Result 2722 states and 4476 transitions. [2018-09-30 20:37:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:37:07,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 20:37:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:07,228 INFO L225 Difference]: With dead ends: 2722 [2018-09-30 20:37:07,228 INFO L226 Difference]: Without dead ends: 2609 [2018-09-30 20:37:07,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-09-30 20:37:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2018-09-30 20:37:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2244. [2018-09-30 20:37:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-09-30 20:37:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3736 transitions. [2018-09-30 20:37:08,208 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3736 transitions. Word has length 15 [2018-09-30 20:37:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:08,208 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 3736 transitions. [2018-09-30 20:37:08,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3736 transitions. [2018-09-30 20:37:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:37:08,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:08,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:08,209 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:08,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1426431952, now seen corresponding path program 1 times [2018-09-30 20:37:08,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:08,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:08,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:08,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:08,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:08,291 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:08,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:08,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:08,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 20:37:08,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:37:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:37:08,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:08,426 INFO L87 Difference]: Start difference. First operand 2244 states and 3736 transitions. Second operand 15 states. [2018-09-30 20:37:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:15,390 INFO L93 Difference]: Finished difference Result 3553 states and 5897 transitions. [2018-09-30 20:37:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 20:37:15,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:37:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:15,394 INFO L225 Difference]: With dead ends: 3553 [2018-09-30 20:37:15,394 INFO L226 Difference]: Without dead ends: 2828 [2018-09-30 20:37:15,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-09-30 20:37:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2018-09-30 20:37:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2605. [2018-09-30 20:37:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-30 20:37:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4312 transitions. [2018-09-30 20:37:16,545 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4312 transitions. Word has length 15 [2018-09-30 20:37:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:16,545 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4312 transitions. [2018-09-30 20:37:16,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:37:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4312 transitions. [2018-09-30 20:37:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:37:16,546 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:16,546 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:16,546 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:16,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:16,546 INFO L82 PathProgramCache]: Analyzing trace with hash -815773655, now seen corresponding path program 1 times [2018-09-30 20:37:16,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:16,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:16,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:16,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:37:16,607 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:16,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:16,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:16,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:16,608 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:16,608 INFO L87 Difference]: Start difference. First operand 2605 states and 4312 transitions. Second operand 7 states. [2018-09-30 20:37:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:18,865 INFO L93 Difference]: Finished difference Result 5552 states and 9149 transitions. [2018-09-30 20:37:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:37:18,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-09-30 20:37:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:18,868 INFO L225 Difference]: With dead ends: 5552 [2018-09-30 20:37:18,868 INFO L226 Difference]: Without dead ends: 3060 [2018-09-30 20:37:18,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2018-09-30 20:37:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2778. [2018-09-30 20:37:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-09-30 20:37:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 4589 transitions. [2018-09-30 20:37:20,060 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 4589 transitions. Word has length 15 [2018-09-30 20:37:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:20,061 INFO L480 AbstractCegarLoop]: Abstraction has 2778 states and 4589 transitions. [2018-09-30 20:37:20,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 4589 transitions. [2018-09-30 20:37:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:37:20,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:20,062 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:20,062 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:20,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1698888354, now seen corresponding path program 1 times [2018-09-30 20:37:20,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:20,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:37:20,119 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:37:20,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:37:20,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:37:20,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:37:20,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:20,119 INFO L87 Difference]: Start difference. First operand 2778 states and 4589 transitions. Second operand 7 states. [2018-09-30 20:37:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:22,529 INFO L93 Difference]: Finished difference Result 6531 states and 10698 transitions. [2018-09-30 20:37:22,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:37:22,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-09-30 20:37:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:22,534 INFO L225 Difference]: With dead ends: 6531 [2018-09-30 20:37:22,534 INFO L226 Difference]: Without dead ends: 3709 [2018-09-30 20:37:22,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:37:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2018-09-30 20:37:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 2911. [2018-09-30 20:37:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-09-30 20:37:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4795 transitions. [2018-09-30 20:37:23,853 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4795 transitions. Word has length 15 [2018-09-30 20:37:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:23,853 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 4795 transitions. [2018-09-30 20:37:23,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:37:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4795 transitions. [2018-09-30 20:37:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:37:23,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:23,854 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:37:23,855 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:23,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:23,855 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-09-30 20:37:23,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:23,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:23,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:23,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:24,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:24,004 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:24,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:24,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:24,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:37:24,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:24,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 20:37:24,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:37:24,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:37:24,116 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:24,117 INFO L87 Difference]: Start difference. First operand 2911 states and 4795 transitions. Second operand 15 states. [2018-09-30 20:37:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:32,147 INFO L93 Difference]: Finished difference Result 4682 states and 7599 transitions. [2018-09-30 20:37:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:37:32,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:37:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:32,151 INFO L225 Difference]: With dead ends: 4682 [2018-09-30 20:37:32,151 INFO L226 Difference]: Without dead ends: 3796 [2018-09-30 20:37:32,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:37:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-09-30 20:37:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 2895. [2018-09-30 20:37:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2018-09-30 20:37:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4687 transitions. [2018-09-30 20:37:33,499 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4687 transitions. Word has length 15 [2018-09-30 20:37:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:33,499 INFO L480 AbstractCegarLoop]: Abstraction has 2895 states and 4687 transitions. [2018-09-30 20:37:33,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:37:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4687 transitions. [2018-09-30 20:37:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:37:33,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:33,500 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:33,500 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:33,500 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1379463247, now seen corresponding path program 2 times [2018-09-30 20:37:33,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:33,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:33,602 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:33,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:37:33,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:37:33,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:37:33,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:33,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:33,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:37:33,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:37:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:37:33,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:33,796 INFO L87 Difference]: Start difference. First operand 2895 states and 4687 transitions. Second operand 17 states. [2018-09-30 20:37:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:42,274 INFO L93 Difference]: Finished difference Result 3400 states and 5492 transitions. [2018-09-30 20:37:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:37:42,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-30 20:37:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:42,278 INFO L225 Difference]: With dead ends: 3400 [2018-09-30 20:37:42,278 INFO L226 Difference]: Without dead ends: 3398 [2018-09-30 20:37:42,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-09-30 20:37:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-09-30 20:37:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2880. [2018-09-30 20:37:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-09-30 20:37:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4659 transitions. [2018-09-30 20:37:43,526 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4659 transitions. Word has length 17 [2018-09-30 20:37:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:43,527 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 4659 transitions. [2018-09-30 20:37:43,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:37:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4659 transitions. [2018-09-30 20:37:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:37:43,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:43,529 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:43,529 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:43,529 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1882250372, now seen corresponding path program 1 times [2018-09-30 20:37:43,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:43,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:43,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:37:43,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:43,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:43,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:43,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:43,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 20:37:43,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:43,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-09-30 20:37:43,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:37:43,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:37:43,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:43,771 INFO L87 Difference]: Start difference. First operand 2880 states and 4659 transitions. Second operand 16 states. [2018-09-30 20:37:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:51,016 INFO L93 Difference]: Finished difference Result 3174 states and 5111 transitions. [2018-09-30 20:37:51,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:37:51,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 20:37:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:51,019 INFO L225 Difference]: With dead ends: 3174 [2018-09-30 20:37:51,019 INFO L226 Difference]: Without dead ends: 3172 [2018-09-30 20:37:51,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-09-30 20:37:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2018-09-30 20:37:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2919. [2018-09-30 20:37:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2018-09-30 20:37:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4721 transitions. [2018-09-30 20:37:52,314 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4721 transitions. Word has length 18 [2018-09-30 20:37:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:37:52,314 INFO L480 AbstractCegarLoop]: Abstraction has 2919 states and 4721 transitions. [2018-09-30 20:37:52,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:37:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4721 transitions. [2018-09-30 20:37:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:37:52,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:37:52,315 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:37:52,316 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:37:52,316 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:37:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-09-30 20:37:52,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:37:52,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:37:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:37:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:37:52,411 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:37:52,411 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:37:52,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:37:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:37:52,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:37:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 20:37:52,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:37:52,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-09-30 20:37:52,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:37:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:37:52,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:37:52,541 INFO L87 Difference]: Start difference. First operand 2919 states and 4721 transitions. Second operand 15 states. [2018-09-30 20:37:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:37:58,899 INFO L93 Difference]: Finished difference Result 3348 states and 5378 transitions. [2018-09-30 20:37:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:37:58,899 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-30 20:37:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:37:58,903 INFO L225 Difference]: With dead ends: 3348 [2018-09-30 20:37:58,903 INFO L226 Difference]: Without dead ends: 3346 [2018-09-30 20:37:58,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:37:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2018-09-30 20:38:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2913. [2018-09-30 20:38:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2913 states. [2018-09-30 20:38:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 4707 transitions. [2018-09-30 20:38:00,246 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 4707 transitions. Word has length 18 [2018-09-30 20:38:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:00,247 INFO L480 AbstractCegarLoop]: Abstraction has 2913 states and 4707 transitions. [2018-09-30 20:38:00,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:38:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 4707 transitions. [2018-09-30 20:38:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:38:00,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:00,248 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:00,248 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:00,248 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1714933202, now seen corresponding path program 2 times [2018-09-30 20:38:00,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:00,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:00,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:00,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:00,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-30 20:38:00,322 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:00,322 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:38:00,339 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:38:00,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:38:00,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:00,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:00,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-30 20:38:00,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:38:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:38:00,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:00,445 INFO L87 Difference]: Start difference. First operand 2913 states and 4707 transitions. Second operand 14 states. [2018-09-30 20:38:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:05,203 INFO L93 Difference]: Finished difference Result 3147 states and 5001 transitions. [2018-09-30 20:38:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 20:38:05,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2018-09-30 20:38:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:05,205 INFO L225 Difference]: With dead ends: 3147 [2018-09-30 20:38:05,206 INFO L226 Difference]: Without dead ends: 3146 [2018-09-30 20:38:05,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:38:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2018-09-30 20:38:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2754. [2018-09-30 20:38:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2018-09-30 20:38:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 4430 transitions. [2018-09-30 20:38:06,395 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 4430 transitions. Word has length 18 [2018-09-30 20:38:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:06,395 INFO L480 AbstractCegarLoop]: Abstraction has 2754 states and 4430 transitions. [2018-09-30 20:38:06,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:38:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 4430 transitions. [2018-09-30 20:38:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:38:06,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:06,397 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:06,397 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:06,397 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1582871485, now seen corresponding path program 1 times [2018-09-30 20:38:06,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:06,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:38:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:38:06,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:06,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:06,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:06,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:38:06,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:06,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-09-30 20:38:06,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 20:38:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 20:38:06,556 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:06,556 INFO L87 Difference]: Start difference. First operand 2754 states and 4430 transitions. Second operand 11 states. [2018-09-30 20:38:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:09,261 INFO L93 Difference]: Finished difference Result 5147 states and 8283 transitions. [2018-09-30 20:38:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:38:09,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-30 20:38:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:09,264 INFO L225 Difference]: With dead ends: 5147 [2018-09-30 20:38:09,264 INFO L226 Difference]: Without dead ends: 3227 [2018-09-30 20:38:09,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:38:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-09-30 20:38:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2898. [2018-09-30 20:38:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2018-09-30 20:38:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4655 transitions. [2018-09-30 20:38:10,465 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4655 transitions. Word has length 18 [2018-09-30 20:38:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 2898 states and 4655 transitions. [2018-09-30 20:38:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 20:38:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4655 transitions. [2018-09-30 20:38:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:38:10,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:10,466 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:10,467 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:10,467 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-09-30 20:38:10,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:10,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:10,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:10,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:10,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:10,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:10,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:10,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-30 20:38:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:38:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:38:10,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:10,773 INFO L87 Difference]: Start difference. First operand 2898 states and 4655 transitions. Second operand 18 states. [2018-09-30 20:38:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:19,203 INFO L93 Difference]: Finished difference Result 3724 states and 5934 transitions. [2018-09-30 20:38:19,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:38:19,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 20:38:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:19,208 INFO L225 Difference]: With dead ends: 3724 [2018-09-30 20:38:19,208 INFO L226 Difference]: Without dead ends: 3722 [2018-09-30 20:38:19,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:38:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-09-30 20:38:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 2958. [2018-09-30 20:38:20,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2018-09-30 20:38:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 4758 transitions. [2018-09-30 20:38:20,524 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 4758 transitions. Word has length 18 [2018-09-30 20:38:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:20,525 INFO L480 AbstractCegarLoop]: Abstraction has 2958 states and 4758 transitions. [2018-09-30 20:38:20,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:38:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 4758 transitions. [2018-09-30 20:38:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:38:20,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:20,526 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-09-30 20:38:20,526 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:20,526 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -386796724, now seen corresponding path program 2 times [2018-09-30 20:38:20,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:20,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:20,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:20,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:20,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:20,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:38:20,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:38:20,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:38:20,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:38:20,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:20,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 20:38:20,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:38:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:38:20,832 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:20,832 INFO L87 Difference]: Start difference. First operand 2958 states and 4758 transitions. Second operand 17 states. [2018-09-30 20:38:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:29,423 INFO L93 Difference]: Finished difference Result 5923 states and 9475 transitions. [2018-09-30 20:38:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:38:29,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 20:38:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:29,427 INFO L225 Difference]: With dead ends: 5923 [2018-09-30 20:38:29,427 INFO L226 Difference]: Without dead ends: 3681 [2018-09-30 20:38:29,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-09-30 20:38:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2018-09-30 20:38:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 2634. [2018-09-30 20:38:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2634 states. [2018-09-30 20:38:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 4224 transitions. [2018-09-30 20:38:30,617 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 4224 transitions. Word has length 18 [2018-09-30 20:38:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:30,617 INFO L480 AbstractCegarLoop]: Abstraction has 2634 states and 4224 transitions. [2018-09-30 20:38:30,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:38:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 4224 transitions. [2018-09-30 20:38:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 20:38:30,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:30,619 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:30,619 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:30,619 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-09-30 20:38:30,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:30,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:30,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:38:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:30,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:30,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:30,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:30,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 20:38:31,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:31,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-09-30 20:38:31,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 20:38:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 20:38:31,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:31,449 INFO L87 Difference]: Start difference. First operand 2634 states and 4224 transitions. Second operand 21 states. [2018-09-30 20:38:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:38:42,377 INFO L93 Difference]: Finished difference Result 3566 states and 5773 transitions. [2018-09-30 20:38:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:38:42,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-09-30 20:38:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:38:42,380 INFO L225 Difference]: With dead ends: 3566 [2018-09-30 20:38:42,380 INFO L226 Difference]: Without dead ends: 3501 [2018-09-30 20:38:42,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-09-30 20:38:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2018-09-30 20:38:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3055. [2018-09-30 20:38:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2018-09-30 20:38:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 4911 transitions. [2018-09-30 20:38:43,717 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 4911 transitions. Word has length 19 [2018-09-30 20:38:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:38:43,717 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 4911 transitions. [2018-09-30 20:38:43,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 20:38:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 4911 transitions. [2018-09-30 20:38:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 20:38:43,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:38:43,718 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:38:43,718 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:38:43,718 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:38:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash -443883967, now seen corresponding path program 1 times [2018-09-30 20:38:43,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:38:43,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:38:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:43,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:38:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:38:43,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:38:43,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:38:43,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:38:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:38:43,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:38:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:38:43,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:38:43,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-30 20:38:43,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:38:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:38:43,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:38:43,899 INFO L87 Difference]: Start difference. First operand 3055 states and 4911 transitions. Second operand 12 states. Received shutdown request... [2018-09-30 20:38:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:38:44,999 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:38:45,005 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:38:45,005 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:38:45 BoogieIcfgContainer [2018-09-30 20:38:45,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:38:45,006 INFO L168 Benchmark]: Toolchain (without parser) took 254300.48 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -32.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:38:45,008 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:45,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:45,009 INFO L168 Benchmark]: Boogie Preprocessor took 28.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:38:45,010 INFO L168 Benchmark]: RCFGBuilder took 483.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:38:45,010 INFO L168 Benchmark]: TraceAbstraction took 253738.74 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -53.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-30 20:38:45,014 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 483.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253738.74 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -53.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (3055states) and FLOYD_HOARE automaton (currently 19 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (142 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (3055states) and FLOYD_HOARE automaton (currently 19 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (142 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (3055states) and FLOYD_HOARE automaton (currently 19 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (142 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (3055states) and FLOYD_HOARE automaton (currently 19 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (142 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 253.6s OverallTime, 59 OverallIterations, 3 TraceHistogramMax, 211.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2108 SDtfs, 7852 SDslu, 5506 SDs, 0 SdLazy, 32270 SolverSat, 4476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2254 GetRequests, 421 SyntacticMatches, 8 SemanticMatches, 1825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3055occurred in iteration=58, 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: 26.5s AutomataMinimizationTime, 58 MinimizatonAttempts, 13656 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 1248 ConstructedInterpolants, 89 QuantifiedInterpolants, 106499 SizeOfPredicates, 210 NumberOfNonLiveVariables, 2034 ConjunctsInSsa, 431 ConjunctsInUnsatCore, 107 InterpolantComputations, 12 PerfectInterpolantSequences, 205/610 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-38-45-025.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-38-45-025.csv Completed graceful shutdown