java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:14:16,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:14:16,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:14:16,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:14:16,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:14:16,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:14:16,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:14:16,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:14:16,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:14:16,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:14:16,527 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:14:16,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:14:16,529 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:14:16,532 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:14:16,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:14:16,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:14:16,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:14:16,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:14:16,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:14:16,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:14:16,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:14:16,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:14:16,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:14:16,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:14:16,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:14:16,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:14:16,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:14:16,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:14:16,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:14:16,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:14:16,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:14:16,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:14:16,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:14:16,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:14:16,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:14:16,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:14:16,566 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:14:16,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:14:16,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:14:16,591 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:14:16,592 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:14:16,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:14:16,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:14:16,592 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:14:16,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:14:16,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:14:16,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:14:16,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:14:16,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:14:16,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:14:16,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:14:16,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:14:16,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:14:16,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:14:16,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:14:16,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:14:16,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:14:16,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:14:16,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:14:16,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:16,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:14:16,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:14:16,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:14:16,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:14:16,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:14:16,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:14:16,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:14:16,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:14:16,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:14:16,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:14:16,674 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:14:16,675 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:14:16,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-10-04 12:14:16,676 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-04 12:14:16,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:14:16,749 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:14:16,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:16,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:14:16,750 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:14:16,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,788 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:14:16,788 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:14:16,789 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:14:16,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:16,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:14:16,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:14:16,792 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:14:16,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:14:16,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:14:16,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:14:16,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:14:16,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:16,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:14:16,882 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:14:16,883 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:14:17,435 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:14:17,436 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17 BoogieIcfgContainer [2018-10-04 12:14:17,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:14:17,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:14:17,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:14:17,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:14:17,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/2) ... [2018-10-04 12:14:17,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157ea762 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:14:17, skipping insertion in model container [2018-10-04 12:14:17,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17" (2/2) ... [2018-10-04 12:14:17,444 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-04 12:14:17,453 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:14:17,461 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 12:14:17,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:14:17,513 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:14:17,513 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:14:17,513 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:14:17,513 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:14:17,514 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:14:17,514 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:14:17,514 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:14:17,514 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:14:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:14:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:17,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:17,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:17,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:17,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:17,544 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-04 12:14:17,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:17,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:17,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:17,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:17,742 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-04 12:14:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:18,362 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-04 12:14:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:18,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:14:18,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:18,378 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:14:18,379 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:14:18,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:14:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:14:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:14:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-04 12:14:18,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-04 12:14:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:18,430 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-04 12:14:18,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-04 12:14:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:14:18,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:14:18,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-04 12:14:18,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:18,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:14:18,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:14:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:14:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:14:18,513 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-04 12:14:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:18,878 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-04 12:14:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:18,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:14:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:18,881 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:14:18,881 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:14:18,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:14:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-04 12:14:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:14:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-04 12:14:18,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-04 12:14:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:18,894 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-04 12:14:18,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:14:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-04 12:14:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:14:18,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:18,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-04 12:14:18,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:19,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:19,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:19,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:19,087 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-04 12:14:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:20,371 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-04 12:14:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:14:20,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 12:14:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:20,374 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:14:20,374 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:14:20,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:14:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-04 12:14:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:14:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-04 12:14:20,394 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-04 12:14:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:20,395 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-04 12:14:20,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-04 12:14:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:14:20,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:20,398 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:14:20,400 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-04 12:14:20,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:20,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:20,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:20,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 12:14:20,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:20,988 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-04 12:14:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:21,863 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-04 12:14:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:14:21,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-04 12:14:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:21,867 INFO L225 Difference]: With dead ends: 142 [2018-10-04 12:14:21,867 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 12:14:21,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:14:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 12:14:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-04 12:14:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:14:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-04 12:14:21,891 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-04 12:14:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:21,891 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-04 12:14:21,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-04 12:14:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:14:21,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:21,894 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:21,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:21,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-04 12:14:21,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:21,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:21,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:22,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:22,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:22,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-04 12:14:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:14:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:14:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:22,169 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-04 12:14:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:22,859 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-04 12:14:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:22,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-04 12:14:22,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:22,862 INFO L225 Difference]: With dead ends: 148 [2018-10-04 12:14:22,862 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 12:14:22,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:14:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 12:14:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-04 12:14:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:14:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-04 12:14:22,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-04 12:14:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:22,887 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-04 12:14:22,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:14:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-04 12:14:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:22,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:22,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:22,889 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:22,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-04 12:14:22,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:23,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:23,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:23,259 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-04 12:14:23,541 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-10-04 12:14:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:24,091 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-04 12:14:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:24,093 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:24,094 INFO L225 Difference]: With dead ends: 124 [2018-10-04 12:14:24,094 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:14:24,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:14:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-04 12:14:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:14:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-04 12:14:24,114 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-04 12:14:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:24,114 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-04 12:14:24,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-04 12:14:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:24,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:24,116 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:24,116 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:24,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:24,117 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-04 12:14:24,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:24,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:24,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:24,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:24,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:24,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:14:24,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:24,273 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-04 12:14:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:24,982 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-04 12:14:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:24,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:14:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:24,984 INFO L225 Difference]: With dead ends: 132 [2018-10-04 12:14:24,984 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 12:14:24,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:14:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 12:14:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-04 12:14:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:14:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-04 12:14:25,006 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-04 12:14:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:25,006 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-04 12:14:25,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-04 12:14:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:25,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:25,007 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:25,008 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:25,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-04 12:14:25,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:25,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:25,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:14:25,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:25,615 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-04 12:14:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:27,188 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-04 12:14:27,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:27,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:27,191 INFO L225 Difference]: With dead ends: 162 [2018-10-04 12:14:27,191 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 12:14:27,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:14:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 12:14:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-04 12:14:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 12:14:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-04 12:14:27,212 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-04 12:14:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-04 12:14:27,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-04 12:14:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:27,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:27,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:27,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-04 12:14:27,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:27,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:27,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:27,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:27,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:27,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:27,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 12:14:27,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:27,490 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-04 12:14:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:29,385 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-04 12:14:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:14:29,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 12:14:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:29,388 INFO L225 Difference]: With dead ends: 223 [2018-10-04 12:14:29,388 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 12:14:29,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 12:14:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-04 12:14:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 12:14:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-04 12:14:29,415 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-04 12:14:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:29,415 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-04 12:14:29,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-04 12:14:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:29,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:29,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:29,417 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-04 12:14:29,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:29,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:29,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:29,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:29,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:29,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:29,691 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-04 12:14:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:31,010 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-04 12:14:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:14:31,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:31,013 INFO L225 Difference]: With dead ends: 222 [2018-10-04 12:14:31,014 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 12:14:31,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 12:14:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-04 12:14:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:14:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-04 12:14:31,046 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-04 12:14:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:31,046 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-04 12:14:31,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-04 12:14:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:31,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:31,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:31,052 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:31,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:31,053 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-04 12:14:31,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:31,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:31,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:31,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:14:31,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:31,224 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-04 12:14:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:31,596 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-04 12:14:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:14:31,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:14:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:31,598 INFO L225 Difference]: With dead ends: 203 [2018-10-04 12:14:31,599 INFO L226 Difference]: Without dead ends: 201 [2018-10-04 12:14:31,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-04 12:14:31,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-04 12:14:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 12:14:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-04 12:14:31,624 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-04 12:14:31,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:31,625 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-04 12:14:31,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-04 12:14:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:31,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:31,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:31,627 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:31,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:31,627 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-04 12:14:31,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:31,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:31,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:31,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:31,774 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:31,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:31,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:31,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-10-04 12:14:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:31,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:31,894 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-04 12:14:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:32,916 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-04 12:14:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:14:32,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:32,919 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:14:32,919 INFO L226 Difference]: Without dead ends: 240 [2018-10-04 12:14:32,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-04 12:14:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-04 12:14:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:14:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-04 12:14:32,943 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-04 12:14:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:32,944 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-04 12:14:32,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-04 12:14:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:32,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:32,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:32,945 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:32,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-04 12:14:32,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:32,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:32,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:14:33,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:33,335 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-04 12:14:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:33,696 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-04 12:14:33,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:14:33,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:14:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:33,698 INFO L225 Difference]: With dead ends: 220 [2018-10-04 12:14:33,698 INFO L226 Difference]: Without dead ends: 218 [2018-10-04 12:14:33,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-04 12:14:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-04 12:14:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 12:14:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-04 12:14:33,724 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-04 12:14:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:33,725 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-04 12:14:33,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-04 12:14:33,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:33,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:33,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:33,726 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:33,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:33,726 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-04 12:14:33,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:33,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:33,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:33,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:33,824 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:33,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:33,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 12:14:33,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:33,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:33,951 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-04 12:14:35,154 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-04 12:14:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:35,653 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-04 12:14:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:14:35,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 12:14:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:35,655 INFO L225 Difference]: With dead ends: 320 [2018-10-04 12:14:35,656 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 12:14:35,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 12:14:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-04 12:14:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 12:14:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-04 12:14:35,688 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-04 12:14:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:35,689 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-04 12:14:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-04 12:14:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:35,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:35,690 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:35,690 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:35,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-04 12:14:35,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:35,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:35,808 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:35,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:14:35,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:35,970 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-04 12:14:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:36,482 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-04 12:14:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:14:36,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:36,483 INFO L225 Difference]: With dead ends: 304 [2018-10-04 12:14:36,483 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 12:14:36,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:14:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 12:14:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-04 12:14:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 12:14:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-04 12:14:36,522 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-04 12:14:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-04 12:14:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-04 12:14:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:36,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:36,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:36,523 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-04 12:14:36,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:36,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:36,717 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:36,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:36,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:36,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:36,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:36,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:36,842 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-04 12:14:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:37,337 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-04 12:14:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:37,337 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:14:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:37,339 INFO L225 Difference]: With dead ends: 281 [2018-10-04 12:14:37,339 INFO L226 Difference]: Without dead ends: 280 [2018-10-04 12:14:37,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-04 12:14:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-04 12:14:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 12:14:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-04 12:14:37,378 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-04 12:14:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:37,378 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-04 12:14:37,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-04 12:14:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:37,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:37,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:37,379 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:37,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-04 12:14:37,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:37,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:37,817 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2018-10-04 12:14:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:37,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:37,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:14:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:14:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:14:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:14:37,831 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-04 12:14:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:38,254 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-04 12:14:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:38,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:14:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:38,256 INFO L225 Difference]: With dead ends: 286 [2018-10-04 12:14:38,257 INFO L226 Difference]: Without dead ends: 284 [2018-10-04 12:14:38,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:14:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-04 12:14:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-04 12:14:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 12:14:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-04 12:14:38,299 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-04 12:14:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:38,299 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-04 12:14:38,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:14:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-04 12:14:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:14:38,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:38,301 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:38,301 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:38,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-04 12:14:38,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:38,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,220 WARN L178 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-04 12:14:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:39,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:39,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:39,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 12:14:39,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:14:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:14:39,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:39,713 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-04 12:14:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:41,753 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-04 12:14:41,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:14:41,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 12:14:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:41,756 INFO L225 Difference]: With dead ends: 515 [2018-10-04 12:14:41,756 INFO L226 Difference]: Without dead ends: 513 [2018-10-04 12:14:41,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:14:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-04 12:14:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-04 12:14:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-04 12:14:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-04 12:14:41,808 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-04 12:14:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:41,808 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-04 12:14:41,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:14:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-04 12:14:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:14:41,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:41,809 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:41,810 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:41,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-04 12:14:41,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:41,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:42,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:42,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:42,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:42,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:42,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 12:14:42,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:14:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:14:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:42,158 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-04 12:14:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:43,588 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-04 12:14:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:14:43,588 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 12:14:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:43,591 INFO L225 Difference]: With dead ends: 631 [2018-10-04 12:14:43,591 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 12:14:43,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:14:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 12:14:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-04 12:14:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 12:14:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-04 12:14:43,670 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-04 12:14:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:43,671 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-04 12:14:43,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:14:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-04 12:14:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:43,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:43,672 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:43,672 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:43,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-04 12:14:43,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:43,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14: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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:43,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:43,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:43,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 12:14:43,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:43,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:43,890 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-04 12:14:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:45,858 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-04 12:14:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:14:45,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:14:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:45,862 INFO L225 Difference]: With dead ends: 1330 [2018-10-04 12:14:45,862 INFO L226 Difference]: Without dead ends: 929 [2018-10-04 12:14:45,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=660, Invalid=3122, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:14:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-04 12:14:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-04 12:14:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-04 12:14:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-04 12:14:45,985 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-04 12:14:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:45,986 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-04 12:14:45,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-04 12:14:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:45,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:45,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:45,987 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:45,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:45,987 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-04 12:14:45,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:45,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:46,119 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:46,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 12:14:46,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:46,309 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-04 12:14:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:47,490 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-10-04 12:14:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:14:47,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:14:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:47,494 INFO L225 Difference]: With dead ends: 1557 [2018-10-04 12:14:47,494 INFO L226 Difference]: Without dead ends: 864 [2018-10-04 12:14:47,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-04 12:14:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-10-04 12:14:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-04 12:14:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-10-04 12:14:47,627 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-10-04 12:14:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:47,627 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-10-04 12:14:47,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-10-04 12:14:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:47,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:47,628 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:47,629 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:47,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-10-04 12:14:47,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:47,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:47,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:47,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:47,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 12:14:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:47,893 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-10-04 12:14:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:48,891 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-10-04 12:14:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:48,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 12:14:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:48,898 INFO L225 Difference]: With dead ends: 1655 [2018-10-04 12:14:48,898 INFO L226 Difference]: Without dead ends: 915 [2018-10-04 12:14:48,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-04 12:14:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-10-04 12:14:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-04 12:14:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-10-04 12:14:49,040 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-10-04 12:14:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:49,040 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-10-04 12:14:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-10-04 12:14:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:49,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:49,041 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:49,041 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-10-04 12:14:49,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:49,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:49,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:49,108 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:49,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:49,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:49,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 12:14:49,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:49,230 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-10-04 12:14:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:49,957 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-10-04 12:14:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:49,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 12:14:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:49,961 INFO L225 Difference]: With dead ends: 939 [2018-10-04 12:14:49,961 INFO L226 Difference]: Without dead ends: 937 [2018-10-04 12:14:49,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-04 12:14:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-10-04 12:14:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-04 12:14:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-10-04 12:14:50,092 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-10-04 12:14:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:50,092 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-10-04 12:14:50,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-10-04 12:14:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:50,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:50,093 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:50,093 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:50,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:50,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-10-04 12:14:50,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:50,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:50,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:50,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:50,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:50,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:50,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:50,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:50,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:50,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 12:14:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:50,607 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-10-04 12:14:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:52,640 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-10-04 12:14:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:14:52,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:14:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:52,645 INFO L225 Difference]: With dead ends: 2058 [2018-10-04 12:14:52,645 INFO L226 Difference]: Without dead ends: 1239 [2018-10-04 12:14:52,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:14:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-10-04 12:14:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-10-04 12:14:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-04 12:14:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-10-04 12:14:52,817 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-10-04 12:14:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:52,817 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-10-04 12:14:52,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-10-04 12:14:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:52,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:52,818 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:52,819 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:52,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-10-04 12:14:52,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:52,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:52,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:52,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:52,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:52,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:52,887 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:52,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:52,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-04 12:14:52,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:52,959 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-10-04 12:14:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:53,712 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-10-04 12:14:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:53,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-04 12:14:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:53,718 INFO L225 Difference]: With dead ends: 1038 [2018-10-04 12:14:53,718 INFO L226 Difference]: Without dead ends: 1036 [2018-10-04 12:14:53,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-10-04 12:14:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-10-04 12:14:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-04 12:14:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-10-04 12:14:53,906 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-10-04 12:14:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:53,906 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-10-04 12:14:53,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-10-04 12:14:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:53,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:53,907 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:53,907 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:53,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-10-04 12:14:53,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:53,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:54,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:54,042 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:54,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:54,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:54,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 12:14:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:54,142 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-10-04 12:14:54,405 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-04 12:14:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:56,227 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-10-04 12:14:56,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:14:56,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:14:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:56,232 INFO L225 Difference]: With dead ends: 2193 [2018-10-04 12:14:56,232 INFO L226 Difference]: Without dead ends: 1286 [2018-10-04 12:14:56,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:14:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-04 12:14:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-10-04 12:14:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-04 12:14:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-10-04 12:14:56,411 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-10-04 12:14:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:56,411 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-10-04 12:14:56,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-10-04 12:14:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:56,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:56,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:56,412 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:56,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-10-04 12:14:56,413 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:56,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:56,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:56,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:56,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:56,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:56,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:56,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 12:14:56,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:56,649 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-10-04 12:14:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:57,814 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-10-04 12:14:57,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:14:57,814 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:14:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:57,818 INFO L225 Difference]: With dead ends: 2165 [2018-10-04 12:14:57,818 INFO L226 Difference]: Without dead ends: 1153 [2018-10-04 12:14:57,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-04 12:14:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-10-04 12:14:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-04 12:14:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-10-04 12:14:57,984 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-10-04 12:14:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:57,984 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-10-04 12:14:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-10-04 12:14:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:57,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:57,986 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:57,986 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:57,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:57,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-10-04 12:14:57,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:57,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:58,068 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:58,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:58,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-04 12:14:58,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:58,217 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-10-04 12:14:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:59,719 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-10-04 12:14:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:59,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 12:14:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:59,723 INFO L225 Difference]: With dead ends: 1397 [2018-10-04 12:14:59,723 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 12:14:59,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 12:14:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-10-04 12:14:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-04 12:14:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-10-04 12:14:59,889 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-10-04 12:14:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:59,890 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-10-04 12:14:59,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-10-04 12:14:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:59,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:59,891 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:59,891 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:59,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:59,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-10-04 12:14:59,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:59,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:59,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:59,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:59,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:59,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:00,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:15:00,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 12:15:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:15:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:15:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:15:00,073 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-10-04 12:15:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:02,524 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-10-04 12:15:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:15:02,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:15:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:02,530 INFO L225 Difference]: With dead ends: 2724 [2018-10-04 12:15:02,531 INFO L226 Difference]: Without dead ends: 1719 [2018-10-04 12:15:02,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=3122, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:15:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-10-04 12:15:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-10-04 12:15:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-04 12:15:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-10-04 12:15:02,768 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-10-04 12:15:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:02,768 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-10-04 12:15:02,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:15:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-10-04 12:15:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:02,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:02,769 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:02,769 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:02,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:02,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-10-04 12:15:02,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:02,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:02,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:02,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:02,894 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:02,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:03,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:03,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2018-10-04 12:15:03,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:03,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:03,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:03,027 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 15 states. [2018-10-04 12:15:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:04,454 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-10-04 12:15:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:15:04,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:15:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:04,459 INFO L225 Difference]: With dead ends: 1442 [2018-10-04 12:15:04,459 INFO L226 Difference]: Without dead ends: 1440 [2018-10-04 12:15:04,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:15:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-04 12:15:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-10-04 12:15:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-04 12:15:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-10-04 12:15:04,684 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-10-04 12:15:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:04,685 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-10-04 12:15:04,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-10-04 12:15:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:15:04,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:04,686 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:04,686 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:04,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-10-04 12:15:04,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:04,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:04,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:04,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:05,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:05,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:05,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:05,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:05,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:05,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-10-04 12:15:05,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:15:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:15:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:15:05,519 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 12 states. [2018-10-04 12:15:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:06,587 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-10-04 12:15:06,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:15:06,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-10-04 12:15:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:06,592 INFO L225 Difference]: With dead ends: 1389 [2018-10-04 12:15:06,592 INFO L226 Difference]: Without dead ends: 1387 [2018-10-04 12:15:06,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:15:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-10-04 12:15:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-10-04 12:15:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-04 12:15:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-10-04 12:15:06,833 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-10-04 12:15:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:06,833 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-10-04 12:15:06,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:15:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-10-04 12:15:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:06,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:06,835 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:06,835 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:06,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-10-04 12:15:06,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:06,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:06,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:06,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:07,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:07,072 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:07,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:07,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:07,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:07,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-04 12:15:07,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:15:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:15:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:15:07,184 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-10-04 12:15:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:08,848 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-10-04 12:15:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:15:08,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-04 12:15:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:08,854 INFO L225 Difference]: With dead ends: 1445 [2018-10-04 12:15:08,854 INFO L226 Difference]: Without dead ends: 1443 [2018-10-04 12:15:08,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:15:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-10-04 12:15:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-10-04 12:15:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 12:15:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 12:15:09,083 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 12:15:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:09,083 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 12:15:09,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:15:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 12:15:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:09,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:09,085 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:09,085 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:09,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-10-04 12:15:09,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:09,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:09,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:09,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:09,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-04 12:15:09,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:15:09,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:15:09,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:15:09,273 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 12 states. [2018-10-04 12:15:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:10,716 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-10-04 12:15:10,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:15:10,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-10-04 12:15:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:10,722 INFO L225 Difference]: With dead ends: 1420 [2018-10-04 12:15:10,722 INFO L226 Difference]: Without dead ends: 1418 [2018-10-04 12:15:10,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:15:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-04 12:15:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-10-04 12:15:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-10-04 12:15:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-10-04 12:15:10,965 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-10-04 12:15:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:10,965 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-10-04 12:15:10,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:15:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-10-04 12:15:10,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:10,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:10,966 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:10,966 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-10-04 12:15:10,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:10,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:11,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:11,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:11,092 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:11,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:11,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:11,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:11,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:15:11,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:15:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:15:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:15:11,143 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-10-04 12:15:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:12,083 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-10-04 12:15:12,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:15:12,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-04 12:15:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:12,087 INFO L225 Difference]: With dead ends: 1334 [2018-10-04 12:15:12,088 INFO L226 Difference]: Without dead ends: 1332 [2018-10-04 12:15:12,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:15:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-10-04 12:15:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-10-04 12:15:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 12:15:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 12:15:12,333 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 12:15:12,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:12,334 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 12:15:12,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:15:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 12:15:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:12,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:12,335 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:12,335 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:12,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-10-04 12:15:12,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:12,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:12,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:12,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:12,468 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:12,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:12,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:15:12,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:15:12,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:15:12,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:15:12,606 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-10-04 12:15:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:13,396 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-10-04 12:15:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:15:13,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-04 12:15:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:13,402 INFO L225 Difference]: With dead ends: 1330 [2018-10-04 12:15:13,402 INFO L226 Difference]: Without dead ends: 1328 [2018-10-04 12:15:13,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:15:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-04 12:15:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-10-04 12:15:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-04 12:15:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-10-04 12:15:13,663 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-10-04 12:15:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:13,663 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-10-04 12:15:13,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:15:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-10-04 12:15:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:13,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:13,664 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:13,665 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:13,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-10-04 12:15:13,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:13,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:13,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:13,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:13,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:13,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:13,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:13,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:13,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:13,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-04 12:15:13,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:15:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:15:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:15:13,857 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 12 states. [2018-10-04 12:15:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:15,185 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-10-04 12:15:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:15:15,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-10-04 12:15:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:15,190 INFO L225 Difference]: With dead ends: 1430 [2018-10-04 12:15:15,190 INFO L226 Difference]: Without dead ends: 1428 [2018-10-04 12:15:15,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:15:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-10-04 12:15:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-10-04 12:15:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-04 12:15:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-04 12:15:15,436 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-04 12:15:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:15,436 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-04 12:15:15,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:15:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-04 12:15:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:15:15,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:15,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:15,437 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:15,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-10-04 12:15:15,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:15,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:15,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:15,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:15,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:15,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:15,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:15,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:15,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-10-04 12:15:15,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:15:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:15:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:15:15,933 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-10-04 12:15:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:17,833 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-10-04 12:15:17,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:15:17,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-10-04 12:15:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:17,837 INFO L225 Difference]: With dead ends: 1432 [2018-10-04 12:15:17,837 INFO L226 Difference]: Without dead ends: 1430 [2018-10-04 12:15:17,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:15:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-04 12:15:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-10-04 12:15:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-04 12:15:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-10-04 12:15:18,075 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-10-04 12:15:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:18,075 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-10-04 12:15:18,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-10-04 12:15:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:18,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:18,077 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:18,077 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:18,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-10-04 12:15:18,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:18,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:18,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:18,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:18,415 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-04 12:15:18,597 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-04 12:15:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:18,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:18,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:18,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:18,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:18,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:15:18,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-10-04 12:15:18,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:15:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:15:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:15:18,878 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-10-04 12:15:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:21,407 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-10-04 12:15:21,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:15:21,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-04 12:15:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:21,410 INFO L225 Difference]: With dead ends: 1695 [2018-10-04 12:15:21,410 INFO L226 Difference]: Without dead ends: 1376 [2018-10-04 12:15:21,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=596, Invalid=4660, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:15:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-04 12:15:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-10-04 12:15:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-04 12:15:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-10-04 12:15:21,637 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-10-04 12:15:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:21,637 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-10-04 12:15:21,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:15:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-10-04 12:15:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:21,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:21,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:21,638 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:21,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-10-04 12:15:21,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:21,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:21,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:21,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:21,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:21,832 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:21,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:21,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:22,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 12:15:22,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:22,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:22,067 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-10-04 12:15:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:24,089 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-10-04 12:15:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:15:24,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:15:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:24,095 INFO L225 Difference]: With dead ends: 1514 [2018-10-04 12:15:24,095 INFO L226 Difference]: Without dead ends: 1219 [2018-10-04 12:15:24,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:15:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-04 12:15:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-10-04 12:15:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-04 12:15:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-10-04 12:15:24,462 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-10-04 12:15:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:24,463 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-10-04 12:15:24,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-10-04 12:15:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:24,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:24,464 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:24,464 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:24,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-10-04 12:15:24,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:24,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:25,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:25,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:25,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:25,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:25,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:25,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-04 12:15:25,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:25,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:25,142 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-10-04 12:15:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:26,839 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-10-04 12:15:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:15:26,839 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-04 12:15:26,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:26,841 INFO L225 Difference]: With dead ends: 2556 [2018-10-04 12:15:26,841 INFO L226 Difference]: Without dead ends: 1529 [2018-10-04 12:15:26,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:15:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-04 12:15:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-10-04 12:15:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-10-04 12:15:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-10-04 12:15:27,103 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-10-04 12:15:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-10-04 12:15:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-10-04 12:15:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:27,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:27,105 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:27,105 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:27,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-10-04 12:15:27,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:27,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:27,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:27,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:27,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:27,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:27,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:15:27,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:27,330 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-10-04 12:15:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:28,920 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-10-04 12:15:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:15:28,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-04 12:15:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:28,923 INFO L225 Difference]: With dead ends: 1546 [2018-10-04 12:15:28,923 INFO L226 Difference]: Without dead ends: 1291 [2018-10-04 12:15:28,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:15:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-04 12:15:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-10-04 12:15:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-10-04 12:15:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-10-04 12:15:29,158 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-10-04 12:15:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:29,158 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-10-04 12:15:29,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-10-04 12:15:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:29,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:29,159 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:29,160 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:29,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:29,160 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-10-04 12:15:29,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:29,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:29,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:29,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:29,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:29,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:29,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:29,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:29,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:15:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:29,255 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-10-04 12:15:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:29,905 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-10-04 12:15:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:15:29,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-04 12:15:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:29,908 INFO L225 Difference]: With dead ends: 1635 [2018-10-04 12:15:29,908 INFO L226 Difference]: Without dead ends: 1494 [2018-10-04 12:15:29,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-04 12:15:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-10-04 12:15:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-04 12:15:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-10-04 12:15:30,285 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-10-04 12:15:30,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:30,286 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-10-04 12:15:30,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-10-04 12:15:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:15:30,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:30,286 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 12:15:30,287 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:30,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-10-04 12:15:30,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:30,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:30,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:30,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:30,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:30,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:30,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:30,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-10-04 12:15:30,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:15:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:15:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:15:30,511 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 17 states. [2018-10-04 12:15:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:34,119 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-10-04 12:15:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:15:34,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-10-04 12:15:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:34,124 INFO L225 Difference]: With dead ends: 2230 [2018-10-04 12:15:34,124 INFO L226 Difference]: Without dead ends: 2180 [2018-10-04 12:15:34,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1477, Invalid=4529, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:15:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-10-04 12:15:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-10-04 12:15:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-10-04 12:15:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-10-04 12:15:34,521 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-10-04 12:15:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:34,522 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-10-04 12:15:34,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:15:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-10-04 12:15:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:15:34,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:34,523 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:34,523 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:34,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-10-04 12:15:34,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:34,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:34,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:34,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:34,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:15:34,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:15:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:15:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:15:34,644 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-10-04 12:15:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:35,181 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-10-04 12:15:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:15:35,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-04 12:15:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:35,183 INFO L225 Difference]: With dead ends: 1760 [2018-10-04 12:15:35,183 INFO L226 Difference]: Without dead ends: 1507 [2018-10-04 12:15:35,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:15:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-04 12:15:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-10-04 12:15:35,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-10-04 12:15:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-10-04 12:15:35,447 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-10-04 12:15:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:35,447 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-10-04 12:15:35,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:15:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-10-04 12:15:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:15:35,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:35,448 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 12:15:35,448 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:35,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-10-04 12:15:35,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:35,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:35,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:35,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:35,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:35,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:35,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:35,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:35,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-10-04 12:15:35,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:15:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:15:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:15:35,661 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 13 states. [2018-10-04 12:15:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:37,814 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-10-04 12:15:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:15:37,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-10-04 12:15:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:37,816 INFO L225 Difference]: With dead ends: 1878 [2018-10-04 12:15:37,816 INFO L226 Difference]: Without dead ends: 1729 [2018-10-04 12:15:37,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:15:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-04 12:15:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-10-04 12:15:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-04 12:15:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-10-04 12:15:38,147 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-10-04 12:15:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:38,148 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-10-04 12:15:38,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-10-04 12:15:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:38,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:38,148 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:38,149 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:38,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-10-04 12:15:38,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:38,301 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:38,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:38,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 12:15:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:15:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:15:38,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:15:38,491 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-10-04 12:15:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:41,960 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-10-04 12:15:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:15:41,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 12:15:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:41,962 INFO L225 Difference]: With dead ends: 2738 [2018-10-04 12:15:41,962 INFO L226 Difference]: Without dead ends: 1726 [2018-10-04 12:15:41,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1197, Invalid=6813, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:15:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-10-04 12:15:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-10-04 12:15:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-04 12:15:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-10-04 12:15:42,341 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-10-04 12:15:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:42,341 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-10-04 12:15:42,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:15:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-10-04 12:15:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:42,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:42,342 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:42,342 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:42,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-10-04 12:15:42,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:42,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:42,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:42,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:42,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:42,536 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:42,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:42,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:42,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:42,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 12:15:42,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:15:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:15:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:15:42,699 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 18 states. [2018-10-04 12:15:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:46,724 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-10-04 12:15:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:15:46,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 12:15:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:46,727 INFO L225 Difference]: With dead ends: 2759 [2018-10-04 12:15:46,727 INFO L226 Difference]: Without dead ends: 2757 [2018-10-04 12:15:46,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=899, Invalid=4503, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:15:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-10-04 12:15:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-10-04 12:15:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-10-04 12:15:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-10-04 12:15:47,146 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-10-04 12:15:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:47,146 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-10-04 12:15:47,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:15:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-10-04 12:15:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:47,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:47,147 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:47,147 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:47,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-10-04 12:15:47,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:47,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:47,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:47,289 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:47,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:47,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:47,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:47,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-10-04 12:15:47,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:47,570 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 16 states. [2018-10-04 12:15:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:51,029 INFO L93 Difference]: Finished difference Result 2657 states and 4320 transitions. [2018-10-04 12:15:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:15:51,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-04 12:15:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:51,032 INFO L225 Difference]: With dead ends: 2657 [2018-10-04 12:15:51,032 INFO L226 Difference]: Without dead ends: 2655 [2018-10-04 12:15:51,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=659, Invalid=2647, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:15:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-10-04 12:15:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1726. [2018-10-04 12:15:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-10-04 12:15:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2827 transitions. [2018-10-04 12:15:51,461 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2827 transitions. Word has length 21 [2018-10-04 12:15:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:51,461 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2827 transitions. [2018-10-04 12:15:51,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2827 transitions. [2018-10-04 12:15:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:51,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:51,462 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:51,462 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1327798635, now seen corresponding path program 1 times [2018-10-04 12:15:51,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:51,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:51,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:51,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:51,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:51,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:51,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-04 12:15:51,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:15:51,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:15:51,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:15:51,724 INFO L87 Difference]: Start difference. First operand 1726 states and 2827 transitions. Second operand 17 states. [2018-10-04 12:15:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:55,695 INFO L93 Difference]: Finished difference Result 2434 states and 3937 transitions. [2018-10-04 12:15:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:15:55,695 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-04 12:15:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:55,697 INFO L225 Difference]: With dead ends: 2434 [2018-10-04 12:15:55,697 INFO L226 Difference]: Without dead ends: 2432 [2018-10-04 12:15:55,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=632, Invalid=3150, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:15:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-10-04 12:15:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1872. [2018-10-04 12:15:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2018-10-04 12:15:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3060 transitions. [2018-10-04 12:15:56,194 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3060 transitions. Word has length 21 [2018-10-04 12:15:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:56,194 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 3060 transitions. [2018-10-04 12:15:56,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:15:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3060 transitions. [2018-10-04 12:15:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:56,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:56,195 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:56,195 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:56,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash 133649308, now seen corresponding path program 2 times [2018-10-04 12:15:56,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:56,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:56,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:56,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:56,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:56,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:56,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:15:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:56,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:56,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:56,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:15:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:56,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-04 12:15:56,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:15:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:15:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:15:56,400 INFO L87 Difference]: Start difference. First operand 1872 states and 3060 transitions. Second operand 16 states. [2018-10-04 12:15:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:59,410 INFO L93 Difference]: Finished difference Result 2526 states and 4072 transitions. [2018-10-04 12:15:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:15:59,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-04 12:15:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:59,413 INFO L225 Difference]: With dead ends: 2526 [2018-10-04 12:15:59,413 INFO L226 Difference]: Without dead ends: 2334 [2018-10-04 12:15:59,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=543, Invalid=2763, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:15:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-04 12:15:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2001. [2018-10-04 12:15:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-10-04 12:15:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3219 transitions. [2018-10-04 12:15:59,963 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3219 transitions. Word has length 21 [2018-10-04 12:15:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 3219 transitions. [2018-10-04 12:15:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:15:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3219 transitions. [2018-10-04 12:15:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:15:59,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:59,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:59,965 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:59,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-10-04 12:15:59,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:59,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:59,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:00,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:00,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:00,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:00,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-04 12:16:00,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:00,552 INFO L87 Difference]: Start difference. First operand 2001 states and 3219 transitions. Second operand 18 states. [2018-10-04 12:16:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:06,069 INFO L93 Difference]: Finished difference Result 2607 states and 4131 transitions. [2018-10-04 12:16:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:16:06,069 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 12:16:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:06,072 INFO L225 Difference]: With dead ends: 2607 [2018-10-04 12:16:06,072 INFO L226 Difference]: Without dead ends: 2605 [2018-10-04 12:16:06,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1198, Invalid=4808, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:16:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2018-10-04 12:16:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1559. [2018-10-04 12:16:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2018-10-04 12:16:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2486 transitions. [2018-10-04 12:16:06,520 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2486 transitions. Word has length 21 [2018-10-04 12:16:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 1559 states and 2486 transitions. [2018-10-04 12:16:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2486 transitions. [2018-10-04 12:16:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:06,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:06,522 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:06,522 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:06,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1950062829, now seen corresponding path program 1 times [2018-10-04 12:16:06,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:07,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:07,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:07,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:07,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:07,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-04 12:16:07,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:07,231 INFO L87 Difference]: Start difference. First operand 1559 states and 2486 transitions. Second operand 18 states. [2018-10-04 12:16:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:12,427 INFO L93 Difference]: Finished difference Result 2107 states and 3306 transitions. [2018-10-04 12:16:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:16:12,428 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 12:16:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:12,430 INFO L225 Difference]: With dead ends: 2107 [2018-10-04 12:16:12,430 INFO L226 Difference]: Without dead ends: 2105 [2018-10-04 12:16:12,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1282, Invalid=6200, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:16:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2018-10-04 12:16:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1432. [2018-10-04 12:16:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-10-04 12:16:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2283 transitions. [2018-10-04 12:16:12,839 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2283 transitions. Word has length 21 [2018-10-04 12:16:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:12,839 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 2283 transitions. [2018-10-04 12:16:12,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2283 transitions. [2018-10-04 12:16:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:12,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:12,840 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:12,840 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:12,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 830618954, now seen corresponding path program 2 times [2018-10-04 12:16:12,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:12,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:12,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:13,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:13,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:13,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:13,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:13,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:13,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:13,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:13,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-04 12:16:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:16:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:16:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:16:13,203 INFO L87 Difference]: Start difference. First operand 1432 states and 2283 transitions. Second operand 15 states. [2018-10-04 12:16:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:16,218 INFO L93 Difference]: Finished difference Result 1886 states and 2991 transitions. [2018-10-04 12:16:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:16:16,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-04 12:16:16,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:16,221 INFO L225 Difference]: With dead ends: 1886 [2018-10-04 12:16:16,221 INFO L226 Difference]: Without dead ends: 1884 [2018-10-04 12:16:16,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=644, Invalid=3138, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:16:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-10-04 12:16:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1404. [2018-10-04 12:16:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-10-04 12:16:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2237 transitions. [2018-10-04 12:16:16,659 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2237 transitions. Word has length 21 [2018-10-04 12:16:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:16,659 INFO L480 AbstractCegarLoop]: Abstraction has 1404 states and 2237 transitions. [2018-10-04 12:16:16,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:16:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2237 transitions. [2018-10-04 12:16:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:16,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:16,661 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:16,661 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:16,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash 822030785, now seen corresponding path program 1 times [2018-10-04 12:16:16,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:16,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:16,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:16,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:16,854 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:16,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:17,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:17,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-04 12:16:17,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:16:17,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:16:17,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:16:17,056 INFO L87 Difference]: Start difference. First operand 1404 states and 2237 transitions. Second operand 20 states. [2018-10-04 12:16:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:21,999 INFO L93 Difference]: Finished difference Result 2676 states and 4218 transitions. [2018-10-04 12:16:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 12:16:21,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-04 12:16:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:22,001 INFO L225 Difference]: With dead ends: 2676 [2018-10-04 12:16:22,001 INFO L226 Difference]: Without dead ends: 1637 [2018-10-04 12:16:22,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1444, Invalid=7486, Unknown=0, NotChecked=0, Total=8930 [2018-10-04 12:16:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-04 12:16:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1391. [2018-10-04 12:16:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2018-10-04 12:16:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2209 transitions. [2018-10-04 12:16:22,454 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2209 transitions. Word has length 21 [2018-10-04 12:16:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 1391 states and 2209 transitions. [2018-10-04 12:16:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:16:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2209 transitions. [2018-10-04 12:16:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:22,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:22,456 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:22,456 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:22,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 822032067, now seen corresponding path program 2 times [2018-10-04 12:16:22,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:22,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:22,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:22,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:22,594 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:22,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:22,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:22,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:22,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2018-10-04 12:16:22,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:22,745 INFO L87 Difference]: Start difference. First operand 1391 states and 2209 transitions. Second operand 18 states. [2018-10-04 12:16:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:27,296 INFO L93 Difference]: Finished difference Result 2169 states and 3390 transitions. [2018-10-04 12:16:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:16:27,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-04 12:16:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:27,298 INFO L225 Difference]: With dead ends: 2169 [2018-10-04 12:16:27,298 INFO L226 Difference]: Without dead ends: 2167 [2018-10-04 12:16:27,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1116, Invalid=5856, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:16:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-10-04 12:16:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1375. [2018-10-04 12:16:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2018-10-04 12:16:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2186 transitions. [2018-10-04 12:16:27,794 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2186 transitions. Word has length 21 [2018-10-04 12:16:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:27,794 INFO L480 AbstractCegarLoop]: Abstraction has 1375 states and 2186 transitions. [2018-10-04 12:16:27,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2186 transitions. [2018-10-04 12:16:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:27,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:27,795 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:27,795 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:27,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -97849607, now seen corresponding path program 1 times [2018-10-04 12:16:27,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:27,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:27,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:27,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:27,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:27,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:28,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:28,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:16:28,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:16:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:16:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:16:28,087 INFO L87 Difference]: Start difference. First operand 1375 states and 2186 transitions. Second operand 19 states. [2018-10-04 12:16:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:31,374 INFO L93 Difference]: Finished difference Result 3096 states and 4913 transitions. [2018-10-04 12:16:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:16:31,375 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 12:16:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:31,377 INFO L225 Difference]: With dead ends: 3096 [2018-10-04 12:16:31,377 INFO L226 Difference]: Without dead ends: 1770 [2018-10-04 12:16:31,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=571, Invalid=2735, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:16:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-10-04 12:16:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1381. [2018-10-04 12:16:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-10-04 12:16:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2193 transitions. [2018-10-04 12:16:31,883 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2193 transitions. Word has length 21 [2018-10-04 12:16:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:31,883 INFO L480 AbstractCegarLoop]: Abstraction has 1381 states and 2193 transitions. [2018-10-04 12:16:31,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:16:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2193 transitions. [2018-10-04 12:16:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:31,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:31,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:31,884 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:31,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 437466707, now seen corresponding path program 1 times [2018-10-04 12:16:31,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:31,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:31,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:31,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:32,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:32,017 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:32,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:32,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-10-04 12:16:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:16:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:16:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:16:32,099 INFO L87 Difference]: Start difference. First operand 1381 states and 2193 transitions. Second operand 13 states. [2018-10-04 12:16:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:34,122 INFO L93 Difference]: Finished difference Result 1858 states and 2972 transitions. [2018-10-04 12:16:34,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:16:34,123 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-10-04 12:16:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:34,124 INFO L225 Difference]: With dead ends: 1858 [2018-10-04 12:16:34,124 INFO L226 Difference]: Without dead ends: 1856 [2018-10-04 12:16:34,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:16:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2018-10-04 12:16:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1551. [2018-10-04 12:16:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2018-10-04 12:16:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2486 transitions. [2018-10-04 12:16:34,671 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2486 transitions. Word has length 21 [2018-10-04 12:16:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:34,671 INFO L480 AbstractCegarLoop]: Abstraction has 1551 states and 2486 transitions. [2018-10-04 12:16:34,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:16:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2486 transitions. [2018-10-04 12:16:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:34,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:34,672 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:34,672 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:34,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:34,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2130898623, now seen corresponding path program 2 times [2018-10-04 12:16:34,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:34,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:34,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:34,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:34,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:34,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:34,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:34,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:34,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-04 12:16:34,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:16:34,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:16:34,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:16:34,979 INFO L87 Difference]: Start difference. First operand 1551 states and 2486 transitions. Second operand 19 states. [2018-10-04 12:16:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:38,420 INFO L93 Difference]: Finished difference Result 1901 states and 3071 transitions. [2018-10-04 12:16:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:16:38,421 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 12:16:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:38,422 INFO L225 Difference]: With dead ends: 1901 [2018-10-04 12:16:38,422 INFO L226 Difference]: Without dead ends: 1899 [2018-10-04 12:16:38,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=509, Invalid=3031, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:16:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2018-10-04 12:16:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1583. [2018-10-04 12:16:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-10-04 12:16:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2523 transitions. [2018-10-04 12:16:39,003 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2523 transitions. Word has length 21 [2018-10-04 12:16:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 2523 transitions. [2018-10-04 12:16:39,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:16:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2523 transitions. [2018-10-04 12:16:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:39,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:39,004 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:39,004 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:39,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2139486792, now seen corresponding path program 1 times [2018-10-04 12:16:39,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:39,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:39,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:39,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:39,111 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:39,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:39,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:39,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:39,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-10-04 12:16:39,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:16:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:16:39,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:16:39,203 INFO L87 Difference]: Start difference. First operand 1583 states and 2523 transitions. Second operand 13 states. [2018-10-04 12:16:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:41,993 INFO L93 Difference]: Finished difference Result 2207 states and 3564 transitions. [2018-10-04 12:16:41,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:16:41,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-10-04 12:16:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:41,996 INFO L225 Difference]: With dead ends: 2207 [2018-10-04 12:16:41,996 INFO L226 Difference]: Without dead ends: 2205 [2018-10-04 12:16:41,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:16:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-04 12:16:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1741. [2018-10-04 12:16:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2018-10-04 12:16:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2777 transitions. [2018-10-04 12:16:42,597 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2777 transitions. Word has length 21 [2018-10-04 12:16:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:42,597 INFO L480 AbstractCegarLoop]: Abstraction has 1741 states and 2777 transitions. [2018-10-04 12:16:42,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:16:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2777 transitions. [2018-10-04 12:16:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:42,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:42,598 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:42,598 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:42,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1673653662, now seen corresponding path program 2 times [2018-10-04 12:16:42,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:42,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:42,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:42,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:42,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:42,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:42,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:42,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:42,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:42,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:42,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-04 12:16:42,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:16:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:16:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:16:42,845 INFO L87 Difference]: Start difference. First operand 1741 states and 2777 transitions. Second operand 15 states. [2018-10-04 12:16:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:47,143 INFO L93 Difference]: Finished difference Result 3370 states and 5507 transitions. [2018-10-04 12:16:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:16:47,143 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-04 12:16:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:47,146 INFO L225 Difference]: With dead ends: 3370 [2018-10-04 12:16:47,146 INFO L226 Difference]: Without dead ends: 3368 [2018-10-04 12:16:47,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=2941, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:16:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2018-10-04 12:16:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2044. [2018-10-04 12:16:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-04 12:16:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3284 transitions. [2018-10-04 12:16:47,875 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3284 transitions. Word has length 21 [2018-10-04 12:16:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:47,875 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 3284 transitions. [2018-10-04 12:16:47,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:16:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3284 transitions. [2018-10-04 12:16:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:16:47,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:47,876 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:47,876 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:47,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash 212422270, now seen corresponding path program 2 times [2018-10-04 12:16:47,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-04 12:16:47,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:47,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:47,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:47,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:47,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:16:48,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:48,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-04 12:16:48,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:16:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:16:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:16:48,022 INFO L87 Difference]: Start difference. First operand 2044 states and 3284 transitions. Second operand 12 states. [2018-10-04 12:16:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:50,753 INFO L93 Difference]: Finished difference Result 5216 states and 8321 transitions. [2018-10-04 12:16:50,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:16:50,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-04 12:16:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:50,755 INFO L225 Difference]: With dead ends: 5216 [2018-10-04 12:16:50,756 INFO L226 Difference]: Without dead ends: 3229 [2018-10-04 12:16:50,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=517, Invalid=1835, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:16:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-10-04 12:16:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2942. [2018-10-04 12:16:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2018-10-04 12:16:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4622 transitions. [2018-10-04 12:16:51,846 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4622 transitions. Word has length 21 [2018-10-04 12:16:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:51,846 INFO L480 AbstractCegarLoop]: Abstraction has 2942 states and 4622 transitions. [2018-10-04 12:16:51,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:16:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4622 transitions. [2018-10-04 12:16:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:16:51,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:51,848 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:51,848 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1977173104, now seen corresponding path program 1 times [2018-10-04 12:16:51,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:51,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:51,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:51,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:16:52,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:52,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:52,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:52,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-04 12:16:52,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:16:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:16:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:16:52,201 INFO L87 Difference]: Start difference. First operand 2942 states and 4622 transitions. Second operand 22 states. [2018-10-04 12:17:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:00,703 INFO L93 Difference]: Finished difference Result 4706 states and 7339 transitions. [2018-10-04 12:17:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 12:17:00,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-04 12:17:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:00,707 INFO L225 Difference]: With dead ends: 4706 [2018-10-04 12:17:00,707 INFO L226 Difference]: Without dead ends: 4704 [2018-10-04 12:17:00,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5067 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2033, Invalid=12009, Unknown=0, NotChecked=0, Total=14042 [2018-10-04 12:17:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-04 12:17:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3514. [2018-10-04 12:17:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-10-04 12:17:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5500 transitions. [2018-10-04 12:17:02,223 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5500 transitions. Word has length 23 [2018-10-04 12:17:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:02,224 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 5500 transitions. [2018-10-04 12:17:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:17:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5500 transitions. [2018-10-04 12:17:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:17:02,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:02,225 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:02,225 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:02,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1266805704, now seen corresponding path program 1 times [2018-10-04 12:17:02,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:02,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:02,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:02,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:02,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:02,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:02,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:02,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-04 12:17:02,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:17:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:17:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:17:02,556 INFO L87 Difference]: Start difference. First operand 3514 states and 5500 transitions. Second operand 21 states. [2018-10-04 12:17:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:09,354 INFO L93 Difference]: Finished difference Result 4911 states and 7636 transitions. [2018-10-04 12:17:09,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:17:09,354 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-10-04 12:17:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:09,358 INFO L225 Difference]: With dead ends: 4911 [2018-10-04 12:17:09,358 INFO L226 Difference]: Without dead ends: 4904 [2018-10-04 12:17:09,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=802, Invalid=3890, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:17:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2018-10-04 12:17:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 2925. [2018-10-04 12:17:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-10-04 12:17:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4501 transitions. [2018-10-04 12:17:11,152 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4501 transitions. Word has length 23 [2018-10-04 12:17:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:11,153 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 4501 transitions. [2018-10-04 12:17:11,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:17:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4501 transitions. [2018-10-04 12:17:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:17:11,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:11,154 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:11,154 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:11,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -407447728, now seen corresponding path program 1 times [2018-10-04 12:17:11,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:11,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:11,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:11,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:11,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:11,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:11,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:11,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-10-04 12:17:11,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:17:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:17:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:17:11,604 INFO L87 Difference]: Start difference. First operand 2925 states and 4501 transitions. Second operand 22 states. [2018-10-04 12:17:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:16,866 INFO L93 Difference]: Finished difference Result 3641 states and 5640 transitions. [2018-10-04 12:17:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:17:16,866 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-04 12:17:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:16,869 INFO L225 Difference]: With dead ends: 3641 [2018-10-04 12:17:16,869 INFO L226 Difference]: Without dead ends: 3634 [2018-10-04 12:17:16,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=768, Invalid=3788, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:17:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2018-10-04 12:17:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 2472. [2018-10-04 12:17:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-10-04 12:17:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3826 transitions. [2018-10-04 12:17:18,069 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3826 transitions. Word has length 23 [2018-10-04 12:17:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:18,070 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3826 transitions. [2018-10-04 12:17:18,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:17:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3826 transitions. [2018-10-04 12:17:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:17:18,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:18,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:18,072 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:18,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1545525427, now seen corresponding path program 1 times [2018-10-04 12:17:18,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:18,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:18,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:18,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:18,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:18,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:18,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:18,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-10-04 12:17:18,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:17:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:17:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:17:18,333 INFO L87 Difference]: Start difference. First operand 2472 states and 3826 transitions. Second operand 15 states. [2018-10-04 12:17:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:22,203 INFO L93 Difference]: Finished difference Result 3028 states and 4680 transitions. [2018-10-04 12:17:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:17:22,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-04 12:17:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:22,206 INFO L225 Difference]: With dead ends: 3028 [2018-10-04 12:17:22,206 INFO L226 Difference]: Without dead ends: 3026 [2018-10-04 12:17:22,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:17:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-10-04 12:17:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2443. [2018-10-04 12:17:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2018-10-04 12:17:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3774 transitions. [2018-10-04 12:17:23,594 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3774 transitions. Word has length 24 [2018-10-04 12:17:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 2443 states and 3774 transitions. [2018-10-04 12:17:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:17:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3774 transitions. [2018-10-04 12:17:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:17:23,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:23,595 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:17:23,595 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:23,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash -136248690, now seen corresponding path program 3 times [2018-10-04 12:17:23,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:23,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:23,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:23,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:23,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:23,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:17:23,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-04 12:17:23,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:23,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-04 12:17:23,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-04 12:17:23,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:17:23,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:17:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:17:23,797 INFO L87 Difference]: Start difference. First operand 2443 states and 3774 transitions. Second operand 15 states. [2018-10-04 12:17:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:26,740 INFO L93 Difference]: Finished difference Result 2592 states and 4005 transitions. [2018-10-04 12:17:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:17:26,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-04 12:17:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:26,742 INFO L225 Difference]: With dead ends: 2592 [2018-10-04 12:17:26,743 INFO L226 Difference]: Without dead ends: 2590 [2018-10-04 12:17:26,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:17:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-10-04 12:17:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2279. [2018-10-04 12:17:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-10-04 12:17:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3506 transitions. [2018-10-04 12:17:28,040 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3506 transitions. Word has length 24 [2018-10-04 12:17:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:28,040 INFO L480 AbstractCegarLoop]: Abstraction has 2279 states and 3506 transitions. [2018-10-04 12:17:28,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:17:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3506 transitions. [2018-10-04 12:17:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:17:28,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:28,041 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:28,041 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:28,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -518454402, now seen corresponding path program 1 times [2018-10-04 12:17:28,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:28,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:28,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:28,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-10-04 12:17:28,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:28,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:28,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:28,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:28,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:28,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-04 12:17:28,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:17:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:17:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:17:28,868 INFO L87 Difference]: Start difference. First operand 2279 states and 3506 transitions. Second operand 16 states. [2018-10-04 12:17:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:32,121 INFO L93 Difference]: Finished difference Result 2414 states and 3709 transitions. [2018-10-04 12:17:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:17:32,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-04 12:17:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:32,123 INFO L225 Difference]: With dead ends: 2414 [2018-10-04 12:17:32,124 INFO L226 Difference]: Without dead ends: 2412 [2018-10-04 12:17:32,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:17:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2018-10-04 12:17:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2274. [2018-10-04 12:17:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2018-10-04 12:17:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3496 transitions. [2018-10-04 12:17:33,476 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3496 transitions. Word has length 24 [2018-10-04 12:17:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:33,476 INFO L480 AbstractCegarLoop]: Abstraction has 2274 states and 3496 transitions. [2018-10-04 12:17:33,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:17:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3496 transitions. [2018-10-04 12:17:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:17:33,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:33,478 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:33,478 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:33,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -916627202, now seen corresponding path program 1 times [2018-10-04 12:17:33,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:33,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:33,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:33,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:33,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:33,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:17:33,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:33,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-04 12:17:33,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:17:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:17:33,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:17:33,881 INFO L87 Difference]: Start difference. First operand 2274 states and 3496 transitions. Second operand 16 states. [2018-10-04 12:17:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:37,483 INFO L93 Difference]: Finished difference Result 2734 states and 4210 transitions. [2018-10-04 12:17:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:17:37,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-10-04 12:17:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:37,485 INFO L225 Difference]: With dead ends: 2734 [2018-10-04 12:17:37,485 INFO L226 Difference]: Without dead ends: 2732 [2018-10-04 12:17:37,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:17:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-10-04 12:17:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2357. [2018-10-04 12:17:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2018-10-04 12:17:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3634 transitions. [2018-10-04 12:17:38,953 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3634 transitions. Word has length 29 [2018-10-04 12:17:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:38,953 INFO L480 AbstractCegarLoop]: Abstraction has 2357 states and 3634 transitions. [2018-10-04 12:17:38,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:17:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3634 transitions. [2018-10-04 12:17:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:17:38,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:38,954 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:38,955 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:38,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash 524508242, now seen corresponding path program 1 times [2018-10-04 12:17:38,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:38,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:39,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:39,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:39,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:39,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-04 12:17:39,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:17:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:17:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:17:39,235 INFO L87 Difference]: Start difference. First operand 2357 states and 3634 transitions. Second operand 17 states. [2018-10-04 12:17:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:48,679 INFO L93 Difference]: Finished difference Result 5146 states and 8058 transitions. [2018-10-04 12:17:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 12:17:48,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-10-04 12:17:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:48,684 INFO L225 Difference]: With dead ends: 5146 [2018-10-04 12:17:48,684 INFO L226 Difference]: Without dead ends: 5144 [2018-10-04 12:17:48,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3126 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1591, Invalid=7915, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:17:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2018-10-04 12:17:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 3465. [2018-10-04 12:17:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-10-04 12:17:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5438 transitions. [2018-10-04 12:17:50,735 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 5438 transitions. Word has length 29 [2018-10-04 12:17:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:50,735 INFO L480 AbstractCegarLoop]: Abstraction has 3465 states and 5438 transitions. [2018-10-04 12:17:50,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:17:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 5438 transitions. [2018-10-04 12:17:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:17:50,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:50,736 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:50,737 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:50,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:50,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1958472419, now seen corresponding path program 4 times [2018-10-04 12:17:50,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:50,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:50,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:50,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:50,864 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:17:50,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:17:50,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:17:50,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:50,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:51,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:51,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-04 12:17:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:17:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:17:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:17:51,119 INFO L87 Difference]: Start difference. First operand 3465 states and 5438 transitions. Second operand 17 states. [2018-10-04 12:18:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:00,081 INFO L93 Difference]: Finished difference Result 4974 states and 7795 transitions. [2018-10-04 12:18:00,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:18:00,082 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-10-04 12:18:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:00,085 INFO L225 Difference]: With dead ends: 4974 [2018-10-04 12:18:00,086 INFO L226 Difference]: Without dead ends: 4972 [2018-10-04 12:18:00,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1292, Invalid=5350, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:18:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2018-10-04 12:18:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 3050. [2018-10-04 12:18:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2018-10-04 12:18:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4722 transitions. [2018-10-04 12:18:02,029 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4722 transitions. Word has length 29 [2018-10-04 12:18:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:02,029 INFO L480 AbstractCegarLoop]: Abstraction has 3050 states and 4722 transitions. [2018-10-04 12:18:02,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:18:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4722 transitions. [2018-10-04 12:18:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:18:02,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:02,031 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:02,031 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:02,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1748672885, now seen corresponding path program 1 times [2018-10-04 12:18:02,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:02,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:02,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:18:02,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:02,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:02,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:02,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:18:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:02,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2018-10-04 12:18:02,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:18:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:18:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:18:02,713 INFO L87 Difference]: Start difference. First operand 3050 states and 4722 transitions. Second operand 24 states. [2018-10-04 12:18:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:23,799 INFO L93 Difference]: Finished difference Result 8298 states and 13026 transitions. [2018-10-04 12:18:23,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-04 12:18:23,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-10-04 12:18:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:23,806 INFO L225 Difference]: With dead ends: 8298 [2018-10-04 12:18:23,807 INFO L226 Difference]: Without dead ends: 8296 [2018-10-04 12:18:23,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18877 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=5438, Invalid=41868, Unknown=0, NotChecked=0, Total=47306 [2018-10-04 12:18:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2018-10-04 12:18:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 5309. [2018-10-04 12:18:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5309 states. [2018-10-04 12:18:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 8285 transitions. [2018-10-04 12:18:26,910 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 8285 transitions. Word has length 31 [2018-10-04 12:18:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:26,911 INFO L480 AbstractCegarLoop]: Abstraction has 5309 states and 8285 transitions. [2018-10-04 12:18:26,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:18:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 8285 transitions. [2018-10-04 12:18:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:18:26,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:26,913 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:18:26,913 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:26,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2080043466, now seen corresponding path program 2 times [2018-10-04 12:18:26,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:18:27,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:27,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:18:27,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:18:27,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:18:27,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:18:27,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-04 12:18:27,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:27,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 25 [2018-10-04 12:18:27,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:18:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:18:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:18:27,342 INFO L87 Difference]: Start difference. First operand 5309 states and 8285 transitions. Second operand 25 states. Received shutdown request... [2018-10-04 12:18:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:18:31,397 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:18:31,401 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:18:31,402 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:31 BoogieIcfgContainer [2018-10-04 12:18:31,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:31,403 INFO L168 Benchmark]: Toolchain (without parser) took 254656.74 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 950.0 MB). Free memory was 1.5 GB in the beginning and 896.2 MB in the end (delta: 578.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:31,403 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-10-04 12:18:31,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 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-10-04 12:18:31,404 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 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-10-04 12:18:31,404 INFO L168 Benchmark]: RCFGBuilder took 620.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:18:31,405 INFO L168 Benchmark]: TraceAbstraction took 253964.70 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 950.0 MB). Free memory was 1.5 GB in the beginning and 896.2 MB in the end (delta: 557.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:31,407 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.19 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 41.87 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 23.97 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 620.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253964.70 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 950.0 MB). Free memory was 1.5 GB in the beginning and 896.2 MB in the end (delta: 557.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 44 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 44 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 44 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 44 states, 25 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 63 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 253.8s OverallTime, 72 OverallIterations, 6 TraceHistogramMax, 196.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2717 SDtfs, 14137 SDslu, 9802 SDs, 0 SdLazy, 81228 SolverSat, 7721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4087 GetRequests, 811 SyntacticMatches, 22 SemanticMatches, 3253 ConstructedPredicates, 0 IntricatePredicates, 11 DeprecatedPredicates, 68896 ImplicationChecksByTransitivity, 85.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5309occurred in iteration=71, 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: 32.2s AutomataMinimizationTime, 71 MinimizatonAttempts, 29941 StatesRemovedByMinimization, 71 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2357 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 2226 ConstructedInterpolants, 174 QuantifiedInterpolants, 288370 SizeOfPredicates, 305 NumberOfNonLiveVariables, 3230 ConjunctsInSsa, 647 ConjunctsInUnsatCore, 137 InterpolantComputations, 14 PerfectInterpolantSequences, 285/1410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-31-416.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-31-416.csv Completed graceful shutdown